✦ LIBER ✦

Integer Programming with a Fixed Number of Variables

✍ Scribed by H. W. Lenstra, Jr.

Book ID: 115535295
Publisher: INFORMS
Year: 1983
Tongue: English
Weight: 433 KB
Volume: 8
Category: Article
ISSN: 0364-765X
DOI: 10.2307/3689168

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stochastic programming with integer vari

Stochastic programming with integer variables

✍ Rüdiger Schultz 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 243 KB

A Note on Reducing the Number of Variabl

A Note on Reducing the Number of Variables in Integer Programming Problems

✍ Nan Zhu; Kevin Broughan 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 123 KB

Solving large-scale mixed-integer progra

Solving large-scale mixed-integer programs with fixed charge variables

✍ Uwe H. Suhl 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 830 KB

Reducing the number of variables in Inte

Reducing the number of variables in Integer and Linear Programming Problems

✍ Djangir A. Babayev; Sahib S. Mardanov 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 411 KB

The number of additional variables requi

The number of additional variables required for the integer programming formulation

✍ Toshihide Ibaraki 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Integer Plane Multiflows with a Fixed Nu

Integer Plane Multiflows with a Fixed Number of Demands

✍ A. Sebo 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 371 KB

We give a polynomial algorithm which decides the integer solvability of multicommodity flow problems where the union of "capacity-" and "demand-edges" forms a planar graph, and the number of demand edges is bounded by a prefixed integer \(k\). This problem was solved earlier for \(k=2\) by Seymour a