Network design with weighted degree constraints
- 作者Takuro Fukunaga; Hiroshi Nagamochi
- 卷第7卷
- 期第4期
- 印刷ISSN1572-5286
- 文件大小369.31KB
- 发表时间2010
- DOI10.1016/j.disopt.2010.05.004
- 页码246-255
同作者推荐
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