Minmax regret bottleneck problems with solution-induced interval uncertainty structure
From MaRDI portal
Publication:429655
DOI10.1016/J.DISOPT.2010.03.007zbMATH Open1241.90177OpenAlexW2074338624MaRDI QIDQ429655FDOQ429655
Authors: Igor Averbakh 
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
Recommendations
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Minmax regret solutions for minimax optimization problems with uncertainty
- Interval data minmax regret network optimization problems
robust optimizationdata uncertaintypolynomial algorithmbottleneck problemsminmax regret optimization
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust Optimization of Large-Scale Systems
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Interval data minmax regret network optimization problems
- Robust convex optimization
- Robust Solutions to Uncertain Semidefinite Programs
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
- On the complexity of the robust spanning tree problem with interval data
- Minmax regret solutions for minimax optimization problems with uncertainty
- Minimax regret spanning arborescences under uncertain costs
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- A Benders decomposition approach for the robust spanning tree problem with interval data
- Complexity of the min-max and min-max regret assignment problems
- Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
- A branch and bound algorithm for the robust spanning tree problem with interval data
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- The computational complexity of the relative robust shortest path problem with interval data
- 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
- Restricted robust uniform matroid maximization under interval uncertainty
Cited In (12)
- Algorithms for the minmax regret path problem with interval data
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Scenario based robust line balancing: Computational complexity
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Restricted robust uniform matroid maximization under interval uncertainty
- Improved polynomial algorithms for robust bottleneck problems with interval data
- On a Class of Interval Data Minmax Regret CO Problems
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Linear Minimax Regret Estimation of Deterministic Parameters with Bounded Data Uncertainties
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
This page was built for publication: Minmax regret bottleneck problems with solution-induced interval uncertainty structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429655)
