Computing and minimizing the relative regret in combinatorial optimization with interval data

DOI10.1016/J.DISOPT.2005.07.001MaRDI QIDQ1019293zbMATH OpenOpenAlexFDO

Authors Igor Averbakh

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

zbMATH Keywords

UncertaintyInterval dataRobust optimizationPolynomial algorithmMinmax regret optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Min max min robust (relative) regret combinatorial optimization
• Minmax regret solutions for minimax optimization problems with uncertainty
• A Probabilistic Model for Minmax Regret in Combinatorial Optimization
• On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data

Cites work

• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 1302174 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• A branch and bound algorithm for the robust shortest path problem with interval data.
• A branch and bound algorithm for the robust spanning tree problem with interval data
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Combinatorial Optimization with Rational Objective Functions
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• Interval data minmax regret network optimization problems
• Minimising the maximum relative regret for linear programmes with interval objective function coefficients
• 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 robust spanning tree problem with interval data
• Robust Optimization of Large-Scale Systems
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Robust convex optimization
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Slowing down sorting networks to obtain faster sorting algorithms
• The computational complexity of the relative robust shortest path problem with interval data
• The minmax relative regret median problem on networks
• The robust spanning tree problem with interval data

Cited in

(20)

• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
• A note on robustness tolerances for combinatorial optimization problems
• Deterministic risk control for cost-effective network connections
• Minimizing maximum risk for fair network connection with interval data
• 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
• Algorithms for the minmax regret path problem with interval data
• Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
• A polynomial solvable minimum risk spanning tree problem with interval data
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
• Complexity results and exact algorithms for robust knapsack 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
• Min-max and min-max (relative) regret approaches to representatives selection problem
• Min-max relative regret for scheduling to minimize maximum lateness
• On a Class of Interval Data Minmax Regret CO Problems
• Algorithms and complexity analysis for robust single-machine scheduling problems
• On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs

This page was built for publication: Computing and minimizing the relative regret in combinatorial optimization with interval data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019293)