Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
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. (C) 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 59(1), 59-72 2012
bandwidth packing problem robust optimization knapsack set polyhedral analysis knapsack cover inequalities routing