✦ LIBER ✦

Some NP-complete problems in linear programming

✍ Scribed by R. Chandrasekaran; Santosh N. Kabadi; Katta G. Murthy

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 342 KB
Volume: 1
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(82)90006-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear Programming in Some Ramsey Proble

Linear Programming in Some Ramsey Problems

✍ B.D. Mckay; S.P. Radziszowski 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 332 KB

We derive new upper bounds for the classical two-color Ramsey numbers \(R(4,5) \leqslant 27, R(5,5) \leqslant 52\), and \(R(4,6) \leqslant 43\); the previous best upper bounds known for these numbers were 28,53 , and 44 , respectively. The new bounds are obtained by solving large integer linear prog

Calculating some inverse linear programm

Calculating some inverse linear programming problems

✍ Jianzhong Zhang; Zhenhong Liu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 546 KB

Average polynomial time complexity of so

Average polynomial time complexity of some NP-complete problems

✍ Phan Dinh Dieu; Le Cong Thanh; Le Tuan Hoa 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 900 KB

On NP-completeness in Linear Logic

✍ Alexey P. Kopylov 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Some non-linear problems of stochastic p

Some non-linear problems of stochastic programming

✍ A.D. Ioffe; D.B. Yudin 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 823 KB

Some algorithms for solving non-linear i

Some algorithms for solving non-linear integer mathematical programming problems

✍ Y.G. Mitev 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 455 KB