Welcome and introduction
- 作者Dr C.M. Lampert
- 卷第25卷
- 期第5期
- 印刷ISSN0141-9382
- 文件大小41.34KB
- 发表时间2004
- DOI10.1016/j.displa.2004.09.018
同作者推荐
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
Min–max and min–max regret versions of combinatorial optimization problems: A surveyHassene Aissi; Cristina Bazgan; Daniel Vanderpooten · 2009
Approximation of min–max and min–max regret versions of some combinatorial optimization problemsHassene Aissi; Cristina Bazgan; Daniel Vanderpooten · 2007