An approximation algorithm for interval data minmax regret combinatorial optimization problems

Cites Work

Robust discrete optimization and its applications
Interval data minmax regret network optimization problems
A branch and bound algorithm for the robust shortest path problem with interval data.
An exact algorithm for the robust shortest path problem with interval data
On the complexity of a class of combinatorial optimization problems with uncertainty
The robust spanning tree problem with interval data
On the complexity of the robust spanning tree problem with interval data
A branch and bound algorithm for the robust spanning tree problem with interval data
The computational complexity of the relative robust shortest path problem with interval data

Cited In (63)

Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs
The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
Robust Algorithms for TSP and Steiner Tree
Query minimization under stochastic uncertainty
On the enumeration of non-dominated matroids with imprecise weights
Learning Control Sets for Lattice Planners from User Preferences
Combinatorial optimization problems with balanced regret
An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
Algorithms for the minmax regret path problem with interval data
On robust online scheduling algorithms
Choosing robust solutions in discrete optimization problems with fuzzy costs
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
A polynomial solvable minimum risk spanning tree problem with interval data
Heuristics for the central tree problem
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
Minmax regret bottleneck problems with solution-induced interval uncertainty structure
Simulated annealing algorithm for the robust spanning tree problem
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
Complexity of the robust weighted independent set problems on interval graphs
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
Distributionally robust single machine scheduling with risk aversion
The minimum spanning tree problem with fuzzy costs
A minmax regret version of the time-dependent shortest path problem
Minmax regret combinatorial optimization problems with investments
Formulation and algorithms for the robust maximal covering location problem
On combinatorial optimization problems on matroids with uncertain weights
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
Robust min-max regret covering problems
The update complexity of selection and related problems
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
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 constant factor approximation for minmax regret problems using a symmetry point scenario
On the approximability of minmax (regret) network optimization problems
A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
Some tractable instances of interval data minmax regret problems
On a Class of Interval Data Minmax Regret CO Problems
Minimax regret spanning arborescences under uncertain costs
Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
Approximating the min-max (regret) selecting items problem
A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
On exact solutions for the minmax regret spanning tree problem
Complexity of the min-max (regret) versions of min cut problems
The robust set covering problem with interval data
Algorithms and complexity analysis for robust single-machine scheduling problems
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
On scenario aggregation to approximate robust combinatorial optimization problems
Complexity of minimizing the total flow time with interval data and minmax regret criterion
A double oracle approach to minmax regret optimization problems with interval data
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
Robust single machine scheduling with a flexible maintenance activity
The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
Efficient Algorithms for k-Regret Minimizing Sets
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
Optimal path discovery problem with homogeneous knowledge
Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
Complexity results for common due date scheduling problems with interval data and minmax regret criterion
Combinatorial two-stage minmax regret problems under interval uncertainty

This page was built for publication: An approximation algorithm for interval data minmax regret combinatorial optimization problems

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