Computational experience with a difficult mixedinteger multicommodity flow problem

D. Bienstock; O. Günlük

doi:10.1007/bf01585766

journal article Jan 01, 1995

Computational experience with a difficult mixedinteger multicommodity flow problem

D. Bienstock O. Günlük

Mathematical Programming Vol. 68 No. 1-3 pp. 213-237 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf01585766

Topics

No keywords indexed for this article. Browse by subject →

References

17

[1]

A. Balakrishnan, T.L. Magnanti and R. Wong, “A dual-ascent procedure for large-scale uncapacitated network design,”Operations Research 37 (1989) 716–740. 10.1287/opre.37.5.716

[2]

S. Ceria, personal communication.

[3]

S. Chopra, “Polyhedra of the equivalent subgraph and some edge connectivity problems,”SIAM Journal on Discrete Mathematics 5 (1992) 321–337. 10.1137/0405024

[4]

W. Cook, personal communication.

[5]

M.D. Grigoriadis and L.G. Khachiyan, “Fast approximation schemes for convex programs with many blocks and coupling constrains,” Report DCS-TR-273, Department of Computer Science, Rutgers University (1991).

[6]

M. Grötschel and C.L. Monma, “Integer polyhedra associated with certain network design problems with connectivity constraints,”SIAM Journal on Discrete Mathematics 3 (1990) 502–523. 10.1137/0403043

[7]

O. Günlük, “Combinatorial optimization problems in lightwave networks,” Ph.D. Thesis, Department of IEOR, Columbia University (1993).

[8]

J.-F. Labourdette, “Rearrangeability techniques for multihop lightwave networks and application to distributed ATM switching systems,” Tech. Report CU/CTR/TR 244-91-25, Center for Telecommunications Research, Columbia University (1991).

[9]

J.-F. Labourdette and A. Acampora, “Partially reconfigurable multihop lightwave networks,”IEEE Transactions on Communication 39 (1991) 1223–1230. 10.1109/26.134012

[10]

F.T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas, “Fast approximation algorithms for multicommodity flow problems,” in:Proceedings 23rd ACM Symposium on Theory of Computing (May 1991) 101–111. 10.1145/103418.103425

[11]

T. Leong, P. Shor and C. Stein, “Implementation of a combinatorial multicommodity flow algorithms,” in:Proceedings DIMACS Implementation Challenge Workshop: Network Flows and Matching (October 1991).

[12]

I. Lustig, personal communication.

[13]

G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988). 10.1002/9781118627372

[14]

M.W. Padberg, T.J. Van Roy and L.A. Wolsey, “Valid linear inequalities for fixed charge problems,”Operations Research 33 (1985) 842–861. 10.1287/opre.33.4.842

[15]

R.L. Rardin and L.A. Wolsey, “Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network network flow problems,” manuscript (1991).

[16]

F. Shahrokhi and D.W. Matula, “The maximum concurrent flow problem,”Journal of the ACM 37 (1990) 318–334. 10.1145/77600.77620

[17]

T.J. Van Roy and L.A. Wolsey, “Valid inequalities and separation for uncapacitated fixed charge networks,”Operations Research Letters 4 (1985) 105–112. 10.1016/0167-6377(85)90012-4

Metrics

48

Citations

17

References

Details

Published: Jan 01, 1995
Vol/Issue: 68(1-3)
Pages: 213-237
License: View

Authors

Cite This Article

D. Bienstock, O. Günlük (1995). Computational experience with a difficult mixedinteger multicommodity flow problem. Mathematical Programming, 68(1-3), 213-237. https://doi.org/10.1007/bf01585766

Computational experience with a difficult mixedinteger multicommodity flow problem

You May Also Like