✦ LIBER ✦

NP-hardness of linear multiplicative programming and related problems

✍ Scribed by T. Matsui

Publisher: Springer US
Year: 1996
Tongue: English
Weight: 362 KB
Volume: 9
Category: Article
ISSN: 0925-5001
DOI: 10.1007/bf00121658

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quadratic programming problems and relat

Quadratic programming problems and related linear complementarity problems

✍ H. Bernau 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 773 KB

Linear complementarity problems and mult

Linear complementarity problems and multiple objective programming

✍ Michael M. Kostreva; Malgorzata M. Wiecek 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 747 KB

On approximability of linear ordering an

On approximability of linear ordering and related NP-optimization problems on graphs

✍ Sounaka Mishra; Kripasindhu Sikdar 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 337 KB

We investigate the approximability of minimum and maximum linear ordering problems (MIN-LOP and MAX-LOP) and related feedback set problems such as maximum weight acyclic subdiagraph (MAX-W-SUBDAG), minimum weight feedback arc/vertex set (MIN-W-FAS/ MIN-W-FVS) and a generalization of the latter calle

On the NP-hardness of edge-deletion and

On the NP-hardness of edge-deletion and -contraction problems

✍ Toshimasa Watanabe; Tadashi Ae; Akira Nakamura 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Duality of infinite-dimensional linear p

Duality of infinite-dimensional linear programming problems and some related matters

✍ V. Temel't 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 622 KB

On Approximability of Linear Ordering an

On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)

✍ Sounaka Mishra; Kripasindhu Sikdar 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 297 KB