Comparative analysis of linear programming relaxations for the robust knapsack problem

DOI10.1007/S10479-022-05161-WzbMATH Open1528.90159MaRDI QIDQ6170571FDOQ6170571

Authors: Seulgi Joung, Seyoung Oh, Kyungsik Lee 

Publication date: 13 July 2023

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

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

zbMATH Keywords

comparative analysisrobust knapsack problemlinear programming relaxationsstrong formulationsinteger optimization models

Mathematics Subject Classification ID

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

Cites Work

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

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)