✦ LIBER ✦

Page cuts for integer interval linear programming

✍ Scribed by R. Armstrong; A. Charnes; F. Phillips

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 842 KB
Volume: 1
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(79)90011-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strengthening cuts for mixed integer pro

Strengthening cuts for mixed integer programs

✍ Egon Balas; Robert G. Jeroslow 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 887 KB

Martin's algorithm and correct cutting p

Martin's algorithm and correct cutting planes for integer linear programming

✍ A.N. Smirnov; V.N. Shevchenko 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 303 KB

Cutting plane algorithms for the inverse

Cutting plane algorithms for the inverse mixed integer linear programming problem

✍ Lizhi Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 677 KB

A finiteness proof for modified dantzig

A finiteness proof for modified dantzig cuts in integer programming

✍ V. J. Bowman Jr.; G. L. Nemhauser 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

where R is the index set associated with the nonbasic variables. If all of the variables are constrained to be nonnegative integers and xu is not an integer in the basic solution, the linear constraint is implied. We prove that including these "cuts" in a specified way yields a finite dual simplex a

A suboptimization method for interval li

A suboptimization method for interval linear programming: a new method for linear programming

✍ Philip D. Robers; Adi Ben-Israel 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 874 KB

An integer linear-programming model for

An integer linear-programming model for machine scheduling

✍ Harvey M. Wagner 📂 Article 📅 1959 🏛 John Wiley and Sons 🌐 English ⚖ 540 KB