Interval data minmax regret network optimization problems
From MaRDI portal
Publication:1827805
DOI10.1016/S0166-218X(03)00462-1zbMath1056.90010MaRDI QIDQ1827805
Igor Averbakh, Vasilij N. Lebedev
Publication date: 6 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10)
Related Items
Random walks on graphs with interval weights and precise marginals ⋮ Robust approach to restricted items selection problem ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem ⋮ On combinatorial optimization problems on matroids with uncertain weights ⋮ On exact solutions for the minmax regret spanning tree problem ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ Minmax regret combinatorial optimization problems with investments ⋮ The robust (minmax regret) assembly line worker assignment and balancing problem ⋮ Computing \(k\)-centers of uncertain points on a real line ⋮ Optimization under Decision-Dependent Uncertainty ⋮ New models for the robust shortest path problem: complexity, resolution and generalization ⋮ The robust set covering problem with interval data ⋮ Robust mean absolute deviation problems on networks with linear vertex weights ⋮ A branch and bound algorithm for the minimax regret spanning arborescence ⋮ Shortest paths with shortest detours. A biobjective routing problem ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) ⋮ Minmax regret maximal covering location problems with edge demands ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ Risk models for the prize collecting Steiner tree problems with interval data ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Deterministic risk control for cost-effective network connections ⋮ Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty ⋮ Combinatorial optimization problems with balanced regret ⋮ The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty ⋮ Exact and heuristic algorithms for the interval data robust assignment problem ⋮ Criticality analysis of activity networks under interval uncertainty ⋮ Minmax regret bottleneck problems with solution-induced interval uncertainty structure ⋮ Possibilistic bottleneck combinatorial optimization problems with ill-known weights ⋮ Approximating a two-machine flow shop scheduling under discrete scenario uncertainty ⋮ Complexity of the min-max (regret) versions of min cut problems ⋮ Risk Averse Shortest Paths: A Computational Study ⋮ Risk-control approach for bottleneck transportation problem with randomness and fuzziness ⋮ On a Class of Interval Data Minmax Regret CO Problems ⋮ On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data ⋮ An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ Combinatorial two-stage minmax regret problems under interval uncertainty ⋮ An enhanced exact procedure for the absolute robust shortest path problem ⋮ Linear programming with interval right hand sides ⋮ Compromise solutions for robust combinatorial optimization with variable-sized uncertainty ⋮ Robust optimization analysis for multiple attribute decision making problems with imprecise information ⋮ On the approximability of minmax (regret) network optimization problems ⋮ Heuristics for the central tree problem ⋮ Reduction approaches for robust shortest path problems ⋮ A minmax regret version of the time-dependent shortest path problem ⋮ Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients ⋮ Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality ⋮ Some tractable instances of interval data minmax regret problems ⋮ Routing Optimization Under Uncertainty ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Computing and minimizing the relative regret in combinatorial optimization with interval data ⋮ A polynomial solvable minimum risk spanning tree problem with interval data ⋮ The minimum spanning tree problem with fuzzy costs ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities ⋮ Choosing robust solutions in discrete optimization problems with fuzzy costs ⋮ Robustness in operational research and decision aiding: a multi-faceted issue ⋮ Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights ⋮ An approximation algorithm for interval data minmax regret combinatorial optimization problems ⋮ The robust shortest path problem in series -- parallel multidigraphs with interval data ⋮ Robust Optimization for the Hazardous Materials Transportation Network Design Problem ⋮ Complexity of the min-max and min-max regret assignment problems ⋮ Robust optimization for the hazardous materials transportation network design problem
Cites Work
- A branch and bound algorithm for the robust spanning tree problem with interval data
- Robust discrete optimization and its applications
- Minmax regret solutions for minimax optimization problems with uncertainty
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
