✦ LIBER ✦

Strongly polynomial algorithm for a class of combinatorial LCPs

✍ Scribed by R Chandrasekaran; S.N Kabadi

Book ID: 107918130
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 139 KB
Volume: 6
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(87)90036-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Combinatorial Algorithm Minimizing Sub

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

✍ Alexander Schrijver 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 108 KB

We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle c

Strongly polynomial and fully combinator

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

✍ S. Thomas McCormick; Satoru Fujishige 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 545 KB

A strongly polynomial algorithm for the

A strongly polynomial algorithm for the transportation problem

✍ P. Kleinschmidt; H. Schannath 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 777 KB

Strongly polynomial-time approximation f

Strongly polynomial-time approximation for a class of bicriteria problems

✍ Asaf Levin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 190 KB

A polynomial algorithm for recognizing t

A polynomial algorithm for recognizing the -order class

✍ Aziz Moukrim; Eric Sanlaville 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 474 KB

Polynomial algorithms for a class of lin

Polynomial algorithms for a class of linear programs

✍ J. F. Maurras; K. Truemper; M. Akgül 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 858 KB