𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A robust approach to the chance-constrained knapsack problem

✍ Scribed by Olivier Klopfenstein; Dritan Nace

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
549 KB
Volume
36
Category
Article
ISSN
0167-6377

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

Dynamic programming approaches to the mu
Dynamic programming approaches to the multiple criteria knapsack problem
✍ Kathrin Klamroth; Margaret M. Wiecek πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 251 KB πŸ‘ 2 views

We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul