✦ LIBER ✦

Complexity of linear programming

✍ Scribed by J.F. Traub; H. Woźniakowski

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational complexity of parametric l

Computational complexity of parametric linear programming

✍ Katta G. Murty 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 408 KB

On low-complexity linear-programming dec

On low-complexity linear-programming decoding of LDPC codes

✍ Vontobel, Pascal O. ;Koetter, Ralf 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

Linear programming in complex space

✍ Norman Levinson 📂 Article 📅 1966 🏛 Elsevier Science 🌐 English ⚖ 665 KB

Complexity analysis of logarithmic barri

Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming

✍ Zhi-Quan Luo; C. Roos; T. Terlaky 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 816 KB

In this paper, we analyze a logarithmic barrier decomposition method for solving a semi-infinite linear programming problem. This method is in some respects similar to the column generation methods using analytic centers. Although the method was found to be very efficient in the recent computational

Characterizations, bounds, and probabili

Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems

✍ Michael J. Todd; Levent Tunçel; Yinyu Ye 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 91 KB

The Graver Complexity of Integer Program

The Graver Complexity of Integer Programming

✍ Yael Berstein; Shmuel Onn 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 220 KB