✦ LIBER ✦

On separating cover inequalities for the multidimensional knapsack problem

✍ Scribed by Tolga Bektas; Osman Oğuz

Book ID: 108105705
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 160 KB
Volume: 34
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2005.05.032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A scheme for exact separation of extende

A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems

✍ V. Gabrel; M. Minoux 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 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

A Genetic Algorithm for the Multidimensi

A Genetic Algorithm for the Multidimensional Knapsack Problem

✍ P.C. Chu; J.E. Beasley 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 178 KB

Greedy algorithm for the general multidi

Greedy algorithm for the general multidimensional knapsack problem

✍ Yalçın Akçay; Haijun Li; Susan H. Xu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 328 KB

Facet defining inequalities for the dich

Facet defining inequalities for the dichotomous knapsack problem

✍ Elsie Sterbin Gottlieb 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 568 KB

A heuristic algorithm for the multidimen

A heuristic algorithm for the multidimensional zero-one knapsack problem

✍ M.J. Magazine; Osman Oguz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 488 KB