Minmax regret bottleneck problems with solution-induced interval uncertainty structure
From MaRDI portal
Publication:429655
DOI10.1016/j.disopt.2010.03.007zbMath1241.90177OpenAlexW2074338624MaRDI QIDQ429655
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.03.007
polynomial algorithmrobust optimizationdata uncertaintybottleneck problemsminmax regret optimization
Related Items (4)
A minimum expected regret model for the shortest path problem with solution-dependent probability distributions ⋮ Scenario based robust line balancing: Computational complexity ⋮ Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion ⋮ Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computational complexity of the relative robust shortest path problem with interval data
- A branch and bound algorithm for the robust spanning tree problem with interval data
- Complexity of the min-max and min-max regret assignment problems
- Restricted robust uniform matroid maximization under interval uncertainty
- Minimax regret spanning arborescences under uncertain costs
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- On the complexity of the robust spanning tree problem with interval data
- Minmax regret solutions for minimax optimization problems with uncertainty
- Interval data minmax regret network optimization problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
- A Benders decomposition approach for the robust spanning tree problem with interval data
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- Robust Convex Optimization
- Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
- Robust Solutions to Uncertain Semidefinite Programs
- Robust Optimization of Large-Scale Systems
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
This page was built for publication: Minmax regret bottleneck problems with solution-induced interval uncertainty structure
