Pages that link to "Item:Q1045926"
From MaRDI portal
The following pages link to An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926):
Displayed 25 items.
- The robust set covering problem with interval data (Q367647) (← links)
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- Heuristics for the central tree problem (Q707727) (← links)
- On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (Q882651) (← links)
- Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795) (← links)
- Simulated annealing algorithm for the robust spanning tree problem (Q945053) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
- Some tractable instances of interval data minmax regret problems (Q1003488) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
- The minimum spanning tree problem with fuzzy costs (Q1028710) (← links)
- Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) (← links)
- Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
- Complexity of the robust weighted independent set problems on interval graphs (Q2018858) (← links)
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) (← links)
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data (Q2643723) (← links)
- On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (Q5448654) (← links)