论文信息 - Multicommodity flow models for spanning trees with hop constraints - 字舞流文

Multicommodity flow models for spanning trees with hop constraints

[1] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..

[2] Thomas L. Magnanti,et al. A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[3] Kemal Altinkemer,et al. Using a Hop-Constrained Model to Generate Alternative Communication Network Design , 2015, INFORMS J. Comput..

[4] Michel X. Goemans,et al. A catalog of steiner tree formulations , 1993, Networks.

[5] Matteo Fischetti,et al. An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs , 1993, INFORMS J. Comput..

[6] T. Magnanti,et al. Modeling and heuristic worst-case performance analysis of the two-level network design problem , 1994 .

[7] Luís Gouveia,et al. Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints , 1995, Comput. Oper. Res..