The capacitated minimum spanning tree problem: On improved multistar constraints

European Journal of Operational Research

Volumn 160, Issue 1, 2005, Pages 47-62

  Gouveia, Luís ^a   Lopes, Maria João ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b INSTITUTO UNIVERSITÁRIO DE LISBOA ISCTE IUL   (Portugal)

Author keywords

Capacitated trees; Lagrangean relaxation; Multistar constraints; Subset sum problems; Valid inequalities

Indexed keywords

COST EFFECTIVENESS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; LAGRANGE MULTIPLIERS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

CAPACITATED TREES; LAGRANGEAN RELAXATION; MULTISTAR CONSTRAINTS; SUBSET SUM PROBLEMS; VALID INEQUALITIES;

TREES (MATHEMATICS);

EID: 3943092534     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.10.021     Document Type: Conference Paper

References (20)

1. Ahuja R., Orlin J., Sharma D. Multi-exchange neighborhood search algorithms for the capacitated spanning tree problem. Mathematical Programming. 91:2001;71-97.
2. Amberg A., Domschke W., Voß S. Capacitated minimum spanning trees: Algorithms using intelligent search. Combinatorial Optimization: Theory and Practice. 1:1996;9-40.
3. Araque, J.R., Hall, L., Magnanti, T., 1990. Capacitated trees, capacitated routing, and associated polyhedra, Technical Report SOR-90-12, Program in Statistics and Operations Research, Princeton University, Princeton, NJ.
4. Fischetti M., Toth P. An efficient algorithm for the min-sum arborescence problem on complete digraphs. ORSA Journal on Computing. 5:1993;426-434.
5. Gavish B. Formulations and algorithms for the capacitated minimal directed tree problem. JACM. 30(1):1983;118-132.
6. Gavish B. Augmented lagrangean based algorithms for centralized network design. IEEE Transactions on Communications. 33:1985;1247-1257.
7. Geoffrion A.M. Lagrangean relaxation for integer programming. Mathematical Programming Study. 2:1974;82-114.
8. Gouveia L. A comparison of directed formulations for the capacitated minimal spanning tree problem. Telecommunication Systems. 1:1993;51-76.
9. Gouveia L., Lopes M.J. Valid inequalities for non-unit demand capacitated spanning tree problem with flow costs. European Journal of Operational Research. 121:2000;394-411.
10. Gouveia L., Martins P. A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem. Networks. 35:2000;1-16.
11. Gouveia L., Paixão J. Dynamic programming based heuristic for the topological design of local access networks. Annals of Operations Research. 33:1991;305-327.
12. Gouveia, L., Lucena, A., Paixão, J., 1990. A set-partitioning approach for the capacitated minimal spanning tree problem. In: Paper presented at the 3rd ORSA Telecommunications SIG Conference, Boca Raton, FL.
13. Hall L. Experience with a cutting plane approach for the capacitated spanning tree problem. Informs Journal on Computing. 8:1996;219-234.
14. Held M., Wolfe P., Crowder H. Validation of subgradient optimization. Mathematical Programming. 6:1974;62-66.
15. Lopes, M.J., 2002. Árvores com restrições de capacidade, custos de fluxo e requerimentos não unitários. Ph D. Thesis, University of Lisbon (in Portuguese).
16. Lucena, A., 1986. Exact solutions approaches for the vehicle routing problem. Ph.D. Thesis, Imperial College.
17. Magnanti T., Wolsey L. Optimal trees in network models. Handbooks in Operations Research and Management Science. 7:1995;503-615.
18. Martello S., Toth P. Knapsack Problems: Algorithms and Computer Implementations. 1990;Wiley, New York.
19. Martins, P, 2002. Private communication to the authors.
20. Papadimitriou C. The complexity of the capacitated tree problem. Networks. 8:1978;217-230.