Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound
- 作者Deeparnab Chakrabarty; Jochen Könemann; David Pritchard
- 卷第38卷
- 期第6期
- 印刷ISSN0167-6377
- 文件大小281.29KB
- 发表时间2010
- DOI10.1016/j.orl.2010.09.004
- 页码567-570
同作者推荐
Sequencing a single machine with due dates and deadlines: anP. Baptiste; F. Della Croce; A. Grosso; V. T’kindt · 2010
Revisiting Branch and Bound Search Strategies for Machine Scheduling ProblemsV. T'kindt; F. Della Croce; C. Esswein · 2004
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problemF. Della Croce; V. T'kindt · 2003
A Recovering Beam Search Algorithm for the One-Machine Dynamic Total Completion Time Scheduling ProblemF. Della Croce and V. T'kindt · The Journal of the Operational Research Society · 2002