The following pages link to Algorithms – ESA 2005 (Q5475893):
Displaying 7 items.
- An \(s\)-\(t\) connection problem with adaptability (Q534328) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (Q882651) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157) (← links)
- The complexity of bottleneck labeled graph problems (Q5961969) (← links)
