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

DOI10.1016/J.DISOPT.2005.07.001zbMATH Open1172.90467OpenAlexW1984167047MaRDI QIDQ1019293FDOQ1019293

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

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

zbMATH Keywords

UncertaintyInterval dataRobust optimizationPolynomial algorithmMinmax regret optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Robust Optimization of Large-Scale Systems
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Interval data minmax regret network optimization problems
• Robust convex optimization
• A branch and bound algorithm for the robust shortest path problem with interval data.
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Combinatorial Optimization with Rational Objective Functions
• On the complexity of a class of combinatorial optimization problems with uncertainty
• The robust spanning tree problem with interval data
• Slowing down sorting networks to obtain faster sorting algorithms
• On the complexity of the robust spanning tree problem with interval data
• Title not available (Why is that?)
• Minmax regret solutions for minimax optimization problems with uncertainty
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• 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
• The computational complexity of the relative robust shortest path problem with interval data
• Minimising the maximum relative regret for linear programmes with interval objective function coefficients
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• The minmax relative regret median problem on networks
• Title not available (Why is that?)

Cited In (20)

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

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)