Approximating Min-Max (Regret) Versions of Some Polynomial Problems
From MaRDI portal
Recommendations
- General approximation schemes for min-max (regret) versions of some (pseudo-)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
Cited in
(25)- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
- Reference points and approximation algorithms in multicriteria discrete optimization
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- A combination of flow shop scheduling and the shortest path problem
- Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms
- A study on several combination problems of classic shop scheduling and shortest path
- Approximating Single Machine Scheduling with Scenarios
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- Polynomially bounded minimization problems which are hard to approximate
- Robust postdonation blood screening under prevalence rate uncertainty
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
- Algorithms – ESA 2005
- Algorithms and Computation
- Approximating the shortest path problem with scenarios
- Robust min-max (regret) optimization using ordered weighted averaging
- Maximizing the minimum voter satisfaction on spanning trees
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- On the approximability of minmax (regret) network optimization problems
- A note on maximizing the minimum voter satisfaction on spanning trees
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
This page was built for publication: Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591305)
