An approximation algorithm for interval data minmax regret combinatorial optimization problems
From MaRDI portal
(Redirected from Publication:1045926)
Recommendations
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- On a Class of Interval Data Minmax Regret CO Problems
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- Computing and minimizing the relative regret in combinatorial optimization with interval data
Cites work
- 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 exact algorithm for the robust shortest path problem with interval data
- Interval data minmax regret network optimization problems
- 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 discrete optimization and its applications
- The computational complexity of the relative robust shortest path problem with interval data
- The robust spanning tree problem with interval data
Cited in
(74)- 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 polynomial solvable minimum risk spanning tree problem with interval data
- Heuristics for the central tree problem
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- Simulated annealing algorithm for the robust spanning tree problem
- Complexity of the robust weighted independent set problems on interval graphs
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- The minimum spanning tree problem with fuzzy costs
- Distributionally robust single machine scheduling with risk aversion
- 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
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- Faster approximation algorithm for the k-regret minimizing set and related problems
- On combinatorial optimization problems on matroids with uncertain weights
- Learning control sets for lattice planners from user preferences
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
- 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
- Robust min-max regret covering problems
- k-regret minimizing set: efficient algorithms and hardness
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- 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 the approximability of minmax (regret) network optimization problems
- Some tractable instances of interval data minmax regret problems
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- Minimax regret spanning arborescences under uncertain costs
- On a Class of Interval Data Minmax Regret CO Problems
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
- Robust Algorithms for TSP and Steiner Tree
- Robust algorithms for TSP and Steiner tree
- Approximating the min-max (regret) selecting items problem
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- On exact solutions for the minmax regret spanning tree problem
- Minmax regret linear resource allocation problems.
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- The robust set covering problem with interval data
- Complexity of the min-max (regret) versions of min cut problems
- Query minimization under stochastic uncertainty
- 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 the enumeration of non-dominated matroids with imprecise weights
- On scenario aggregation to approximate robust combinatorial optimization problems
- A double oracle approach to minmax regret optimization problems with interval data
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- Robust single machine scheduling with a flexible maintenance activity
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Combinatorial optimization problems with balanced regret
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
- Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
- Online multi-dimensional generalized assignment problem with predictions
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
- Greediness is not always a vice: efficient discovery algorithms for assignment problems
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
- Optimal path discovery problem with homogeneous knowledge
- Efficient Algorithms for k-Regret Minimizing Sets
- 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
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- 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)
