✦ LIBER ✦

Valid inequalities for mixed 0–1 programs

✍ Scribed by Tony J. Van Roy; Laurence A. Wolsey

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 531 KB
Volume: 14
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90061-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of minimal valid ineq

A characterization of minimal valid inequalities for mixed integer programs

✍ Achim Bachem; Ellis L. Johnson; Rainer Schrader 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 332 KB

Valid inequalities and separation for mi

Valid inequalities and separation for mixed 0–1 constraints with variable upper bounds

✍ Michel X. Goemans 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 449 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

Valid inequalities for 0–1 knapsacks and

Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints

✍ Laurence A. Wolsey 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Modelling topology optimization problems

Modelling topology optimization problems as linear mixed 0–1 programs

✍ M. Stolpe; K. Svanberg 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract This paper deals with topology optimization of discretized continuum structures. It is shown that a large class of non‐linear 0–1 topology optimization problems, including stress‐ and displacement‐constrained minimum weight problems, can equivalently be modelled as __linear__ mixed 0–1

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