✦ LIBER ✦

Facet defining inequalities for the dichotomous knapsack problem

✍ Scribed by Elsie Sterbin Gottlieb

Book ID: 107918183
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 568 KB
Volume: 9
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(90)90036-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique-based facets for the precedence c

Clique-based facets for the precedence constrained knapsack problem

✍ Natashia Boland, Andreas Bley, Christopher Fricke, Gary Froyland, Renata Sotirov 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 643 KB

Lifting valid inequalities for the prece

Lifting valid inequalities for the precedence constrained knapsack problem

✍ R.L.M.J. van de Leensel; C.P.M. van Hoesel; J.J. van de Klundert 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 163 KB

On separating cover inequalities for the

On separating cover inequalities for the multidimensional knapsack problem

✍ Tolga Bektas; Osman Oğuz 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 160 KB

n-step mingling inequalities: new facets

n-step mingling inequalities: new facets for the mixed-integer knapsack set

✍ Alper Atamtürk; Kiavash Kianfar 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 273 KB

Cover inequalities for robust knapsack s

Cover inequalities for robust knapsack sets—Application to the robust bandwidth packing problem

✍ Olivier Klopfenstein; Dritan Nace 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

## Abstract The robust optimization framework proposed by Bertsimas and Sim accounts for data uncertainty in integer linear programs. This article investigates the polyhedral impacts of this robust model for the 0‐1 knapsack problem. In particular, classical cover cuts are adapted to provide valid

The generalized assignment problem: Vali

The generalized assignment problem: Valid inequalities and facets

✍ Elsie Sterbin Gottlieb; M. R. Rao 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 944 KB