A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization

DOI10.1016/J.DAM.2020.07.002MaRDI QIDQ2197476zbMATH OpenOpenAlexFDO

Authors Christoph Buchheim

Publication date 31 August 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2020.07.002

zbMATH Keywords

robust combinatorial optimizationoracle-based algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Recommendations

• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• Min-max-min robust combinatorial optimization
• Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions

Cites work

• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• Approximation algorithms for reliable stochastic combinatorial optimization
• Complexity of the min-max (regret) versions of min cut problems
• Complexity of the min-max and min-max regret assignment problems
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Robust combinatorial optimization with knapsack uncertainty
• Robust convex optimization
• Robust discrete optimization and network flows

Cited in

(4)

• An oracle-based framework for robust combinatorial optimization
• A note on robustness tolerances for combinatorial optimization problems
• Robust algorithms: a different approach to oracles
• scientific article; zbMATH DE number 1445399 (Why is no real title available?)

This page was built for publication: A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization

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