Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
By Cynthia Barnhart, C. Hane, P. H. Vance. Operational Research, 2000
386 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/ef9968a9b7639239cedd5fdad39fe450674a7afe
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Michal Pióro
- D. Medhi
- Marco E. Lübbecke
- Renato F. Werneck
- Ricardo Fukasawa
- Jacques Desrosiers
- Francis R. Bach
- Thomas Schlechte
In Computer Networks and Communications
In Industrial and Manufacturing Engineering
- Michal Pióro
- D. Medhi
- Marco E. Lübbecke
- Jens Lysgaard
- Jacques Desrosiers
- Roberto Baldacci
- Aristide Mingozzi
- Richard W. Eglese
Citations in the corpus
- Selected Topics in Column Generation (2002, background): “We remark that adding cutting planes in conjunction with column generation in a branch-and-bound search is usually called branch and price and cut ; see e.g., Barnhart et al. (1998a), Barnhart et al. (2000), and Park et al. (1996).”
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (2004, background): “In the late 1990’s, several researchers [41,21, 22,40,15,9] independently noted that cuts expressed in terms of variables from a suitable original formulation could be dynamically separated, translated and added to the master problem.”
- Routing, flow, and capacity design in communication and computer networks (2004, methodology): “Other works dealing with exact methods for solving the single-path routing problems of the A/SPA type are [BB03], [BHV00], [Gef01], [GNS98], [GNS99], [PK96], and [PKL03].”