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)
90C47: Minimax problems in mathematical programming
90B10: Deterministic network models in operations research
Related Items
Optimization under Decision-Dependent Uncertainty, Robust mean absolute deviation problems on networks with linear vertex weights, On a Class of Interval Data Minmax Regret CO Problems, Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality, Random walks on graphs with interval weights and precise marginals, A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem, On exact solutions for the minmax regret spanning tree problem, New models for the robust shortest path problem: complexity, resolution and generalization, The robust set covering problem with interval data, Risk models for the prize collecting Steiner tree problems with interval data, Two-stage minimax regret robust uncapacitated lot-sizing problems with demand 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, Risk-control approach for bottleneck transportation problem with randomness and fuzziness, An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem, Deterministic risk control for cost-effective network connections, Exact and heuristic algorithms for the interval data robust assignment problem, Criticality analysis of activity networks under interval uncertainty, Heuristics for the central tree problem, Reduction approaches for robust shortest path problems, A minmax regret version of the time-dependent shortest path problem, Complexity of the min-max and min-max regret assignment problems, On combinatorial optimization problems on matroids with uncertain weights, A branch and bound algorithm for the minimax regret spanning arborescence, 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), Complexity of the min-max (regret) versions of min cut problems, On the approximability of minmax (regret) network optimization problems, Some tractable instances of interval data minmax regret problems, 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, 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, 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, Shortest paths with shortest detours. A biobjective routing problem, Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets, Compromise solutions for robust combinatorial optimization with variable-sized uncertainty, Robust optimization analysis for multiple attribute decision making problems with imprecise information, Robust optimization for the hazardous materials transportation network design problem, Algorithm robust for the bicriteria discrete optimization problem, On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data, The robust shortest path problem in series -- parallel multidigraphs with interval data, Routing Optimization Under Uncertainty, Robust Optimization for the Hazardous Materials Transportation Network Design Problem, The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows, An enhanced exact procedure for the absolute robust shortest path problem, Linear programming with interval right hand sides
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
