✦ LIBER ✦

The lexicographic α-robust knapsack problem

✍ Scribed by Rim Kalaï; Daniel Vanderpooten

Book ID: 111206058
Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 164 KB
Volume: 18
Category: Article
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.2010.00786.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lexicographic α -robustness: an applicat

Lexicographic α -robustness: an application to the 1-median problem

✍ Kalaï, R.; Aloulou, M. A.; Vallin, Ph.; Vanderpooten, D. 📂 Article 📅 2010 🏛 EDP Sciences 🌐 French ⚖ 288 KB

Exact solution of the robust knapsack pr

Exact solution of the robust knapsack problem

✍ Monaci, Michele; Pferschy, Ulrich; Serafini, Paolo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Pareto lexicographic α-robust approach a

Pareto lexicographic α-robust approach and its application in robust multi objective assembly line balancing problem

✍ Saif, Ullah; Guan, Zailin; Wang, Baoxi; Mirza, Jahanzeb 📂 Article 📅 2014 🏛 Springer-Verlag 🌐 English ⚖ 148 KB

A robust approach to the chance-constrai

A robust approach to the chance-constrained knapsack problem

✍ Olivier Klopfenstein; Dritan Nace 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 549 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

Lexicographic α-robustness: An alternati

Lexicographic α-robustness: An alternative to min–max criteria

✍ Rim Kalaı¨; Claude Lamboray; Daniel Vanderpooten 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 284 KB