Generating hard instances for robust combinatorial optimization

DOI10.1016/j.ejor.2019.07.036zbMath1430.90483arXiv1811.00824OpenAlexW2963903450WikidataQ127453454 ScholiaQ127453454MaRDI QIDQ2272296

Marc Goerigk, Stephen J. Maher

Publication date: 9 September 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.00824

zbMATH Keywords

combinatorial optimizationrobust optimizationrobustness and sensitivity analysisproblem benchmarkingproblem generation

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Uses Software

• MIPLIB
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
• Min-max-min robust combinatorial optimization
• Exact and heuristic algorithms for the interval data robust assignment problem
• Reduction approaches for robust shortest path problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• The polynomial-time hierarchy
• Robust discrete optimization and its applications
• Adjustable robust solutions of uncertain linear programs
• Where are the hard knapsack problems?
• On scenario aggregation to approximate robust combinatorial optimization problems
• Representative scenario construction and preprocessing for robust combinatorial optimization problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

This page was built for publication: Generating hard instances for robust combinatorial optimization