A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
From MaRDI portal
Publication:2441360
DOI10.1007/s10288-013-0231-6zbMath1302.90136OpenAlexW2163551942WikidataQ62048276 ScholiaQ62048276MaRDI QIDQ2441360
Eduardo Álvarez-Miranda, Ivana Ljubić, Paolo Toth
Publication date: 24 March 2014
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-013-0231-6
Related Items (18)
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ Robust combinatorial optimization with variable cost uncertainty ⋮ Approximate robust optimization for the connected facility location problem ⋮ A VNS-LP algorithm for the robust dynamic maximal covering location problem ⋮ Exact solution of the robust knapsack problem ⋮ Robust combinatorial optimization with knapsack uncertainty ⋮ 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 ⋮ A branch and bound algorithm for robust binary optimization with budget uncertainty ⋮ The robust vehicle routing problem with time windows: solution by branch and price and cut ⋮ 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 ⋮ A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty ⋮ The gain of robustness for a storage loading problem ⋮ 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 ⋮ Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations ⋮ Exact approaches for solving robust prize-collecting Steiner tree problems
Cites Work
This page was built for publication: A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
