Multicommodity flow models for spanning trees with hop constraints

European Journal of Operational Research

Volumn 95, Issue 1, 1996, Pages 178-190

  Gouveia, Luis ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Hop constraints; Integer programming; Linear programming relaxations; Multicommodity flows; Reliability; Trees

Indexed keywords

COMPUTER NETWORKS; CONSTRAINT THEORY; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBABILITY; RELIABILITY; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

HOP CONSTRAINTS; MULTICOMMODITY FLOWS; SPANNING TREES;

OPERATIONS RESEARCH;

EID: 0030283804     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00090-9     Document Type: Article

References (12)

1. Balakrishnan, A., and Altinkemer, K. (1992), "Using a hop-constrained model to generate alternative communication network designs", ORSA Journal on Computing 4, 192-205.
2. Balakrishnan, A., Magnanti, T., and Wong, R. (1989), "A dual ascent procedure for large-scale uncapacitated network design", Operations Research 37, 714-740.
3. Balakrishnan, A., Magnanti, T., and Mirchandani, P. (1994), "Modelling and heuristic worst-case performance analysis of the two-level network design problem", Management Science 40, 846-867.
4. Edmonds, J. (1968), "Optimum branchings", in: G.B. Dantzig and A.F. Veinott Jr, eds., Mathematics of the Decision Sciences, Lectures in Applied Mathematics, pp. 346ff.
5. Fischetti, M. and Toth, P. (1993), "An efficient algorithm for the min-sum arborescence problem on complete digraphs", ORSA Journal on Computing 5, 426-434.
6. Geoffrion, A.M. (1974), "Lagrangean relaxation for integer programming", Mathematical Programming Study 2, 82-114.
7. Goemans, M., and Myung, Y. (1993), "A catalog of Steiner tree formulations", Networks 23, 19-28.
8. Gouveia, L. (1993), "Using the Miller-Tucker-Zemlin constraints to formulate minimal spanning trees with Hop constraints", Computers and Operations Research 22 (1995) 959-970.
9. Held, M., Wolfe, P. and Crowder, H. (1974), "Validation of subgradient optimization", Mathematical Programming 6, 62-66.
10. LeBlanc, L. and Reddoch, R., (1990), "Reliable link topology/capacity design and routing in backbone telecommunication networks", paper presented at the First ORSA Telecommunications SIG Conference "Operations Research in Telecommunications".
11. Maculan, N. (1986), "A new linear programming formulation for the shortest s-directed spanning tree problem", Journal of Combinatorics Information and System Sciences 11, 53-56.
12. Martin, R.K. (1986), "A sharp polynomial size linear programming formulation of the minimum spanning tree problem", Working Paper, University Chicago.