A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
From MaRDI portal
(Redirected from Publication:319447)
Recommendations
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- A double oracle approach to minmax regret optimization problems with interval data
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- The minmax regret robust shortest path problem in a finite multi-scenario model
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- A branch and bound algorithm for the robust shortest path problem with interval data.
- A quick method for finding shortest pairs of disjoint paths
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Complexity of the min-max (regret) versions of min cut problems
- Complexity of the min-max and min-max regret assignment problems
- Interval data minmax regret network optimization problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Network flows. Theory, algorithms, and applications.
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- On the complexity of minmax regret linear programming
- Robust discrete optimization and its applications
- Robust optimization
- Robust optimization-methodology and applications
- The robust spanning tree problem with interval data
Cited in
(20)- On scenario aggregation to approximate robust combinatorial optimization problems
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem
- A robust optimization model for distribution network design under a mixed integer set of scenarios
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
- Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Combinatorial optimization problems with balanced regret
- Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Generating hard instances for robust combinatorial optimization
- Variable-sized uncertainty and inverse problems in robust optimization
- Combinatorial two-stage minmax regret problems under interval uncertainty
- A double oracle approach to minmax regret optimization problems with interval data
- Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions
- Algorithms for the minmax regret path problem with interval data
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
This page was built for publication: A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319447)
