Comparative analysis of linear programming relaxations for the robust knapsack problem

DOI10.1007/S10479-022-05161-WMaRDI QIDQ6170571zbMATH OpenFDO

Authors Seulgi Joung, Seyoung Oh, Kyungsik Lee

Publication date 13 July 2023

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

zbMATH Keywords

comparative analysisrobust knapsack problemlinear programming relaxationsstrong formulationsinteger optimization models

Mathematics Subject Classification ID

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

Recommendations

• On the robust knapsack problem
• Complexity results and exact algorithms for robust knapsack problems
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
• Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
• A note on upper bounds to the robust knapsack problem with discrete scenarios

Cites work

• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 1953186 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A robust approach to the chance-constrained knapsack problem
• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• Algorithms and uncertainty sets for data-driven robust shortest path problems
• Constructing uncertainty sets for robust linear optimization
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Data-driven robust optimization
• Exact solution of the robust knapsack problem
• Lifting and separation of robust cover inequalities
• Robust discrete optimization and network flows
• Robust optimization
• Robust optimization approach for a chance-constrained binary knapsack problem
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
• Robust solutions of uncertain linear programs
• Robustness concepts for knapsack and network design problems under data uncertainty. Gamma-, multi-band, submodular, and recoverable robustness
• Strong formulations of robust mixed 0-1 programming
• Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
• The Price of Robustness
• Theory and applications of robust optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170571)