General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
DOI10.1016/J.DISOPT.2010.03.004zbMATH Open1241.90176OpenAlexW2007863759MaRDI QIDQ429650FDOQ429650
Authors: Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten 
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.03.004
Recommendations
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Algorithms – ESA 2005
- On the approximability of minmax (regret) network optimization problems
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
minimum spanning treeapproximationshortest pathknapsackmin-maxfptasmin-max regretminimum weighted perfect matching
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust discrete optimization and its applications
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Approximating Multiobjective Knapsack Problems
- Approximation schemes for a class of subset selection problems
- Exact arborescences, matchings and cycles
- The combinatorial approach yields an NC algorithm for computing Pfaffians
- Title not available (Why is that?)
- Systems of distinct representatives and linear algebra
Cited In (20)
- Algorithms – ESA 2005
- A unified approach to uncertain optimization
- 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 quickest path problems
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
- On the approximability of minmax (regret) network optimization problems
- Robust Discrete Optimization Problems with the WOWA Criterion
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
- Using the WOWA operator in robust discrete optimization problems
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Combinatorial optimization problems with uncertain costs and the OWA criterion
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- Proportional and maxmin fairness for the sensor location problem with chance constraints
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective
- An improved genetic algorithm for single-machine inverse scheduling problem
This page was built for publication: General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429650)
