海量图书期刊资源,随时随地畅享阅读乐趣
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