✦ LIBER ✦

Strengthening cuts for mixed integer programs

✍ Scribed by Egon Balas; Robert G. Jeroslow

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 887 KB
Volume: 4
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(80)90106-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Inequalities for mixed integer programs

Inequalities for mixed integer programs with structure

✍ Fred Glover; David Sommer 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB

On mixed integer quadratic programs

✍ S. C. Agrawal 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 394 KB

Page cuts for integer interval linear pr

Page cuts for integer interval linear programming

✍ R. Armstrong; A. Charnes; F. Phillips 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 842 KB

A cutting-plane approach to mixed 0–1 st

A cutting-plane approach to mixed 0–1 stochastic integer programs

✍ Claus C. Carøe; Jørgen Tind 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 773 KB

We consider a mixed 0-1 integer programming problem with dual block-angular structure arising in two-stage stochastic programming. A relaxation is proposed such that the problem is decomposed into subproblems each corresponding to the outcomes of the random variable. The convex hull of feasible solu