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

DOI10.1002/net.20488zbMath1241.90113OpenAlexW2012963530MaRDI QIDQ2892146

Olivier Klopfenstein, Dritan Nace

Publication date: 18 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20488

zbMATH Keywords

robust optimizationroutingpolyhedral analysisknapsack setknapsack cover inequalitiesbandwidth packing problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (16)

Robust optimization approach for a chance-constrained binary knapsack problem ⋮ Exact solution of the robust knapsack problem ⋮ A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks ⋮ Robust network design: Formulations, valid inequalities, and computations ⋮ Easy distributions for combinatorial optimization problems with probabilistic constraints ⋮ Cutting and packing problems under uncertainty: literature review and classification framework ⋮ Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees ⋮ Improved handling of uncertainty and robustness in set covering problems ⋮ Robust combinatorial optimization with variable budgeted uncertainty ⋮ Comparative analysis of linear programming relaxations for the robust knapsack problem ⋮ Lifting of probabilistic cover inequalities ⋮ Recoverable robust knapsacks: the discrete scenario case ⋮ Speeding up column generation for robust wireless network planning ⋮ A branch and price approach for the robust bandwidth packing problem with queuing delays ⋮ Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem ⋮ Exact approaches for solving robust prize-collecting Steiner tree problems

Cites Work

• Unnamed Item
• A robust approach to the chance-constrained knapsack problem
• Robust discrete optimization and network flows
• A note on robust 0-1 optimization with uncertain cost coefficients
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
• Multi-layer MPLS network design: The impact of statistical multiplexing
• Strong formulations of robust mixed 0-1 programming
• Easily Computable Facets of the Knapsack Polytope
• Tractable algorithms for chance-constrained combinatorial problems
• The Price of Robustness
• Solving Large-Scale Zero-One Linear Programming Problems
• Faces for a linear inequality in 0–1 variables
• Facets of the knapsack polytope
• An Integer Programming Approach to the Bandwidth Packing Problem
• Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
• Solving Multiple Knapsack Problems by Cutting Planes

This page was built for publication: Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem