Multistars and Directed Flow Formulations

Networks

Volumn 40, Issue 4, 2002, Pages 188-201

  Gouveia, Luis ^a   Hall, Leslie ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Capacitated trees; Integer programming; Polyhedral projection; Separation algorithms

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; INTEGER PROGRAMMING; POLYNOMIALS;

NETWORK FLOW FORMULATIONS;

TREES (MATHEMATICS);

EID: 0141429897     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10050     Document Type: Article

References (19)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms and applications, Prentice-Hall, Englewood Cliffs, NJ, 1994.
2. J.R. Araque, L.A. Hall, and T.L. Magnanti, Capacitated trees, capacitated routing, and associated polyhedra, Technical Report SOR-90-12, Princeton University, 1990.
3. A. Balakrishnan, T. Magnanti, and R. Wong, A dual ascent procedure for large-scale uncapacitated network design, Oper Res 37 (1989), 714-740.
4. J. Edmonds, Matroids and the greedy algorithm, Math Program 1 (1971), 127-136.
5. B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, J ACM 30 (1983), 11-132.
6. B. Gavish, Augmented Lagrangean based algorithms for centralized network design, IEEE Trans Commun Com-33 (1985), 1247-1257.
7. M. Goemans and M. Myung, A catalog of Steiner tree formulations, Networks 23 (1993), 19-28.
8. L. Gouveia, A comparison of directed formulations for the capacitated minimal spanning tree problem, Telecommun Sys 1 (1993), 51-66.
9. L. Gouveia, A 2n-constraint formulation for the capacitated minimal spanning tree problem, Oper Res 43 (1995), 130-141.
10. L. Gouveia and P. Martins, A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem, Networks 35 (2000), 1-16.
11. L.A. Hall, Two topics in discrete optimization: Polyhedral structure of capacitated trees and approximation algorithms for scheduling, Ph.D. Thesis, Operations Research Center, The Massachusetts Institute of Technology, 1989.
12. L.A. Hall, Computational experience with a cutting plane algorithm for a capacitated network design problem, INFORMS J Comput 8 (1996), 219-234.
13. T. Magnanti and S. Raghavan, Strong formulations for network design problems with connectivity requirements, Working paper OR 332-99, Operations Research Center, The Massachusetts Institute of Technology, 1999.
14. T.L. Magnanti and L. Wolsey, "Optimal trees," Handbooks in operations research and management science, North-Holland, Amsterdam, 1996, Vol. 7.
15. T.L. Magnanti, and R. Wong, Network design and transportation planning: Models and algorithms, Trans Sci 18 (1984), 1-55.
16. G. Nemhauser and L. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1998.
17. C. Papadimitriou, The complexity of the capacitated spanning tree problem, Networks 8 (1978), 217-230.
18. W. Pulleyblank, "Polyhedral combinatorics," Handbooks in operations research and management science, North-Holland, Amsterdam, 1989, Vol. 1.
19. N. Zhang, Facet-defining inequalities for capacitated spanning trees, Master's Thesis, Princeton University, 1993.