Approximation of min–max and min–max regret versions of some combinatorial optimization problems
- 作者Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten
- 卷第179卷
- 期第2期
- 印刷ISSN0377-2217
- 文件大小218.32KB
- 发表时间2007
- DOI10.1016/j.ejor.2006.03.023
- 页码281-290
同作者推荐
Complexity of the min–max and min–max regret assignment problemsHassene Aissi; Cristina Bazgan; Daniel Vanderpooten · 2005
Complexity of the min–max (regret) versions of min cut problemsHassene Aissi; Cristina Bazgan; Daniel Vanderpooten · 2008
General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problemsHassene Aissi; Cristina Bazgan; Daniel Vanderpooten · 2010
Min–max and min–max regret versions of combinatorial optimization problems: A surveyHassene Aissi; Cristina Bazgan; Daniel Vanderpooten · 2009