Minimum cost capacity installation for multicommodity network flows

Mathematical Programming, Series B

Volumn 81, Issue 2, 1998, Pages 177-199

  Bienstock, Daniel ^a   Chopra, Sunil ^b   Günlük, Oktay ^c   Tsai, Chih Yang ^d  

^a Department of Applied Physics and Applied Mathematics   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

^c UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^d STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

Integer programming; Network design

Indexed keywords

EID: 0001022584     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01581104     Document Type: Article

References (15)

1. F. Barahona, Network design using cut inequalities, SIAM Journal on Optimization 6 (1996).
2. D. Bienstock, O. Günlük, Capacitated network design polyhedral structure and computation, INFORMS Journal on Computing (1996) 243-259.
3. K. Huffman, M. Padberg, Improving LP-representation of zero-one linear programs for branch-and-cut, ORSA Journal on Computing 3 (2) (1991) 121-134.
4. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
5. K. Onaga, O. Kakusho, On feasibility conditions of multicommodity flows in networks, IEEE Transactions in Circuit Theory, CT-18 (4) 425-429.
6. R.L. Rardin, L.A. Wolsey, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network network flow problems, European Journal of Operational Research (November 1993).
7. D. Bienstock, O. Günlük, Computational experience with a difficult mixed-integer multicommodity flow problem, Mathematical Programming 68 (1995) 213-238.
8. W.R. Pulleyblank, Polyhedral combinatorics, in: G.L. Nemhauser et al. (Eds.), Handhooks in OR & MS, vol. 1, North-Holland, Amsterdam, 1989, pp. 371-446.
9. D. Bienstock, S. Chopra, O. Günlük, C.-Y. Tsai, Minimum cost capacity installation for multicommodity network flows, CORE Discussion Paper, Université Catholique de Louvain. Belgium (1995).
10. K. Hoffman, M. Padberg, Solving airline crew scheduling problems by branch-and-cut, Management Science 39 (6) (1993) 657-682.
11. M. Padbergl, G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Review 33 (1991) 60-100.
12. T. Magnanti, P. Mirchandani, R. Vachani, Modeling and solving the two facility capacitated network loading problem, Operations Research 43 (1) (1995) 142-157.
13. F. Barahona, personal communication.
14. M. Stoer, G. Dahl, A polyhedral approach to multicommodity survivable network design, Numerische Mathematik 68 (1) (1994) 149-167.
15. M. Stoer, private communication.