𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem

✍ Scribed by Mercedes Landete, Juan Francisco Monge, Antonio M. Rodríguez-Chía

Book ID
120966603
Publisher
Springer US
Year
2012
Tongue
English
Weight
776 KB
Volume
207
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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