A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
From MaRDI portal
Publication:2257099
DOI10.1007/s10288-014-0270-7zbMath1308.90111OpenAlexW2067948003MaRDI QIDQ2257099
Publication date: 23 February 2015
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-014-0270-7
Related Items (14)
Soft robust solutions to possibilistic optimization problems ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ Recycling inequalities for robust combinatorial optimization with budget uncertainty ⋮ Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions ⋮ A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization ⋮ Comparative analysis of linear programming relaxations for the robust knapsack problem ⋮ A branch and bound algorithm for robust binary optimization with budget uncertainty ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach ⋮ The multi-band robust knapsack problem -- a dynamic programming approach ⋮ Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty ⋮ Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut
Cites Work
This page was built for publication: A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
