✦ LIBER ✦

Cutting planes for mixed-integer knapsack polyhedra

✍ Scribed by Xiao-Qing Yan; E. Andrew Boyd

Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 376 KB
Volume: 81
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01581108

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cutting planes from a mixed integer Fark

Cutting planes from a mixed integer Farkas lemma

✍ Matthias Köppe; Robert Weismantel 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 189 KB

We present a mixed integer version of the lattice analogue of the Farkas lemma. It gives rise to a family of mixed-integer rounding cuts for mixed integer programs, which depend on the choice of a lattice basis. By choosing a LovÃ asz-reduced basis, one can hope to generate numerically advantageous

Cutting planes for integer programs with

Cutting planes for integer programs with general integer variables

✍ Sebastián Ceria; Cécile Cordier; Hugues Marchand; Laurence A. Wolsey 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 795 KB

The mixed cutting plane algorithm for al

The mixed cutting plane algorithm for all-integer programming

✍ Larry M. Austin; Bharat C. Ruparel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 677 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

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