1 |
Gouveia, L., 'Multicommodity flow models for spanning trees with hop constraints,' European Journal of Operational Research 95 (1996), 178-190
DOI
ScienceOn
|
2 |
Gouveia, L. and C. Requejo, 'A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem,' European Journal of Operational Research 132 (2001), 539-552
DOI
ScienceOn
|
3 |
Gouveia, L., 'Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints,' Computers and Operations Research 22, 9 (1995), 959-970
DOI
ScienceOn
|
4 |
Park, K., S. Kang, and S. Park, 'An integer programming approach to the bandwidth packing problem,' Management Science 42, 9 (1996), 1277-1291
DOI
ScienceOn
|
5 |
Gouveia, L., 'Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints,' INFORMS Journal on Computing 10, 2 (1998), 180-188
DOI
ScienceOn
|
6 |
Chvatal, V., Linear programming, Freeman, New York, 1983
|