Cover inequalities for robust knapsack sets - Application to the robust bandwidth packing problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Networks Année : 2012

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

Résumé

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 inequalities for the robust knapsack problem. The strength of the proposed inequalities is studied theoretically. Then, experiments on the robust bandwidth packing problem illustrate the practical interest of these inequalities for solving hard robust combinatorial problems.

Dates et versions

hal-00782616 , version 1 (30-01-2013)

Identifiants

Citer

Olivier Klopfenstein, Dritan Nace. Cover inequalities for robust knapsack sets - Application to the robust bandwidth packing problem. Networks, 2012, 59 (1), pp.59-72. ⟨10.1002/net.20488⟩. ⟨hal-00782616⟩
60 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More