Comparative analysis of linear programming relaxations for the robust knapsack problem

DOI10.1007/s10479-022-05161-wzbMath1528.90159MaRDI QIDQ6170571

Se-Young Oh, Seulgi Joung, Kyungsik Lee

Publication date: 13 July 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

linear programming relaxationscomparative analysisrobust knapsack problemstrong formulationsinteger optimization models

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust optimization approach for a chance-constrained binary knapsack problem
• Exact solution of the robust knapsack problem
• A robust approach to the chance-constrained knapsack problem
• Robust solutions of uncertain linear programs
• Robust discrete optimization and network flows
• Algorithms and uncertainty sets for data-driven robust shortest path problems
• Data-driven robust optimization
• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Strong formulations of robust mixed 0-1 programming
• Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
• Constructing Uncertainty Sets for Robust Linear Optimization
• Theory and Applications of Robust Optimization
• The Price of Robustness
• Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
• Lifting and separation of robust cover inequalities

This page was built for publication: Comparative analysis of linear programming relaxations for the robust knapsack problem