Computing and minimizing the relative regret in combinatorial optimization with interval data
From MaRDI portal
Publication:1019293
DOI10.1016/j.disopt.2005.07.001zbMath1172.90467OpenAlexW1984167047MaRDI QIDQ1019293
Publication date: 2 June 2009
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2005.07.001
Related Items
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs, The robust (minmax regret) assembly line worker assignment and balancing problem, Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem, Min-max and min-max (relative) regret approaches to representatives selection problem, Deterministic risk control for cost-effective network connections, Min-max relative regret for scheduling to minimize maximum lateness, Algorithms and complexity analysis for robust single-machine scheduling problems, Min max min robust (relative) regret combinatorial optimization, An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem, Complexity results and exact algorithms for robust knapsack problems, Minimizing maximum risk for fair network connection with interval data, Min-max and min-max regret versions of combinatorial optimization problems: A survey, A polynomial solvable minimum risk spanning tree problem with interval data, A note on robustness tolerances for combinatorial optimization problems, On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computational complexity of the relative robust shortest path problem with interval data
- A branch and bound algorithm for the robust spanning tree problem with interval data
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- A branch and bound algorithm for the robust shortest path 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
- Interval data minmax regret network optimization problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Robust Convex Optimization
- The Minmax Relative Regret Median Problem on Networks
- Minimising the maximum relative regret for linear programmes with interval objective function coefficients
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Combinatorial Optimization with Rational Objective Functions
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Slowing down sorting networks to obtain faster sorting algorithms
- Robust Optimization of Large-Scale Systems
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
