A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source maximum concurrent flow

Electronic Notes in Discrete Mathematics

Volumn 41, Issue , 2013, Pages 311-318

  Bauguion, Pierre Olivier ^a   Ben Ameur, Walid ^b   Gourdin, Eric ^a  

^a ORANGE LABS   (France)

^b INSTITUT TELECOM   (France)

Author keywords

Column generation; Maximum concurrent flow; Tree packing

Indexed keywords

EID: 84879704215     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2013.05.107     Document Type: Article

References (4)

1. Ben-Ameur W., Neto J. Acceleration of cutting planes and column generation algorithms: Application to network design. Networks 2007, 49:3-17.
2. Derigs U., Meier W. Implementing Goldberg's Max-Flow-Algorithm A Computational Investigation. ZOR - Methods & Models of OR 1989, 33:383-403.
3. Edmonds J., Karp R.M. Theoretical improvements in algorithmic efficiency for network flow problem. Journal of the ACM 1971, 19(2):248-264.
4. Shahrokhi F., Matula D.W. On Solving Large Maximum Concurrent Flow Problems. Journal of the ACM 1991, 37:318-334.