Minmax regret bottleneck problems with solution-induced interval uncertainty structure

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

Cites work

scientific article; zbMATH DE number 3511563 (Why is no real title available?)
scientific article; zbMATH DE number 3534506 (Why is no real title available?)
A Benders decomposition approach for the robust spanning tree problem with interval data
A branch and bound algorithm for the robust spanning tree problem with interval data
An approximation algorithm for interval data minmax regret combinatorial optimization problems
An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
Complexity of the min-max and min-max regret assignment problems
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
Interval data minmax regret network optimization problems
Minimax regret spanning arborescences under uncertain costs
Minmax regret solutions for minimax optimization problems with uncertainty
Network flows. Theory, algorithms, and applications.
On the complexity of a class of combinatorial optimization problems with uncertainty
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
On the complexity of the robust spanning tree problem with interval data
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
Restricted robust uniform matroid maximization under interval uncertainty
Robust Optimization of Large-Scale Systems
Robust Solutions to Uncertain Semidefinite Programs
Robust convex optimization
Robust discrete optimization and its applications
Robust discrete optimization and network flows
The computational complexity of the relative robust shortest path problem with interval data
The robust shortest path problem in series -- parallel multidigraphs with interval data
The robust spanning tree problem with interval data

Cited in

(13)

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
The minmax regret inverse maximum weight problem
Restricted robust uniform matroid maximization under interval uncertainty
On the complexity of a class of combinatorial optimization problems with uncertainty
Improved polynomial algorithms for robust bottleneck problems with interval data
A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
On a Class of Interval Data Minmax Regret CO Problems
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)