{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T10:44:13Z","timestamp":1774262653008,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":86,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540428770","type":"print"},{"value":"9783540455868","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45586-8_6","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T05:06:11Z","timestamp":1180328771000},"page":"223-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Branch, Cut, and Price: Sequential and Parallel"],"prefix":"10.1007","author":[{"given":"Laszlo","family":"Lad\u00e1nyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ted K.","family":"Ralphs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr","given":"Leslie E.","family":"Trotter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"6_CR1","first-page":"483","volume":"30","author":"G.M. Amdahl","year":"1967","unstructured":"Amdahl, G.M.: Validity of the Single-processor Approach to Achieving Largescale Computing Capabilities. In AFIPS Conference Proceedings 30 (Atlantic City, N.J., April 18\u201320), AFIPS Press (1967), 483","journal-title":"Validity of the Single-processor Approach to Achieving Largescale Computing Capabilities"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., and Cook, W.: On the solution of traveling salesman problems, Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, International Congress of Mathematicians (1998), 645","DOI":"10.4171\/dms\/1-3\/62"},{"key":"6_CR3","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., and Cook, W.: CONCORDE TSP Solver. Available at http:\/\/www.keck.caam.rice.edu\/concorde.html"},{"key":"6_CR4","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., and Cook, W.: Finding Cuts in the TSP. DIMACS Technical Report 95-05, 1995"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1002\/net.3230190702","volume":"7","author":"Y. Agarwal","year":"1989","unstructured":"Agarwal, Y., Mathur, K., and Salkin, H.M.: Set Partitioning Approach to Vehicle Routing. Networks 7, 731, 1989","journal-title":"Networks"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF02085634","volume":"50","author":"J.R. Araque","year":"1994","unstructured":"Araque, J.R., Kudva, G., Morin, T.L., and Pekny, J.F.: A Branch-and-Cut Algorithm for Vehicle Routing Problems. Annals of Operations Research 50, 37, 1994","journal-title":"Annals of Operations Research"},{"key":"6_CR7","unstructured":"Araque, J.R., Hall, L., and Magnanti, T.: Capacitated Trees, Capacitated Routing and Associated Polyhedra. Discussion paper 9061, CORE, Louvain La Nueve, 1990"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/S0377-2217(97)00290-7","volume":"106","author":"P. Augerat","year":"1998","unstructured":"Augerat, P., Belenguer, J.M., Benavent, E., Corber\u00e1n, A., and Naddef, D.: Separating Capacity Constraints in the CVRP Using Tabu Search. European Journal of Operations Research 106, 546, 1998","journal-title":"European Journal of Operations Research"},{"key":"6_CR9","series-title":"Research Report","volume-title":"Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem","author":"P. Augerat","year":"1995","unstructured":"Augerat, P., Belenguer, J.M., Benavent, E., Corber\u00e1n, A., Naddef, D., and Rinaldi, G.: Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Research Report 949-M, Universit\u00e9 Joseph Fourier, Grenoble, France, 1995"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"Balas, E., Ceria, S., and Cornu\u00e9jols, G.: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework. Management Science 42, 9, 1996","journal-title":"Management Science"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"Balas, E., and Padberg, M.W.: Set Partitioning: A Survey. SIAM Review 18, 710, 1976","journal-title":"SIAM Review"},{"key":"6_CR12","first-page":"361","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E. Balas","year":"1985","unstructured":"Balas, E., and Toth, P.: Branch and Bound Methods. In Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G, and Shmoys, D.B., eds., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York, 361, 1985."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M.L. Balinski","year":"1964","unstructured":"Balinski, M.L., and Quandt, R.E.: On an Integer Program for a Delivery Problem. Operations Research 12, 300, 1964","journal-title":"Operations Research"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F., and Anbil, R.: The Volume Algorithm: Producing Primal Solutions with a Subgradient Method. Mathematical Programming 87, 385, 2000","journal-title":"Mathematical Programming"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., and Vance, P.H.: Branch-and-Price: Column Generation for Huge Integer Programs. Operations Research 46, 316, 1998","journal-title":"Operations Research"},{"key":"6_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BFb0027123","volume-title":"Solving Combinatorial Optimization Problems in Parallel","author":"M. Benchouche","year":"1996","unstructured":"Benchouche, M., Cung, V.-D., Dowaji, S., Le Cun, B., Mautor, T., and Roucairol, C.: Building a Parallel Branch and Bound Library. In Solving Combinatorial Optimization Problems in Parallel, Lecture Notes in Computer Science 1054, Springer, Berlin, 201, 1996"},{"key":"6_CR17","unstructured":"Blasum, U., and Hochst\u00e4ttler, W.: Application of the Branch and Cut Method to the Vehicle Routing Problem. Zentrum f\u00fcr Angewandte Informatik K\u00f6ln Technical Report zpr2000-386, 2000"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0377-2217(88)90160-9","volume":"34","author":"R.L. Boehning","year":"1988","unstructured":"Boehning, R.L., Butler, R.M., and Gillet, B.E.: A Parallel Integer Linear Programming Algorithm. European Journal of Operations Research 34, 393, 1988","journal-title":"European Journal of Operations Research"},{"key":"6_CR19","unstructured":"Bornd\u00f6rfer, R.: Aspects of Set Packing, Patitioning, and Covering. PhD. Dissertation, Technischen Universit\u00e4t Berlin, 1997"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0377-2217(91)90337-U","volume":"52","author":"V. Campos","year":"1991","unstructured":"Campos, V., Corber\u00e1n, A., and Mota, E.: Polyhedral Results for a Vehicle Routing Problem. European Journal of Operations Research 52, 75, 1991","journal-title":"European Journal of Operations Research"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Chen, Q., and Ferris, M.C.: FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver. University of Wisconsin CS Department Technical Report 99-05, Madison, WI, 1999","DOI":"10.21236\/ADA375528"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N. Christofides","year":"1969","unstructured":"Christofides, N., and Eilon, S.: An Algorithm for the Vehicle Dispatching Problem, Operational Research Quarterly 20, 309, 1969","journal-title":"Operational Research Quarterly"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N. Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., and Toth, P.: Exact Algorithms for Solving the Vehicle Routing Problem Based on Spanning Trees and Shortest Path Relaxations. Mathematical Programming 20, 255, 1981","journal-title":"Mathematical Programming"},{"key":"6_CR24","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V.: Linear Programming. W.H. Freeman and Company, San Francisco, 1983"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01580599","volume":"60","author":"G. Cornu\u00e9jols","year":"1993","unstructured":"Cornu\u00e9jols, G., and Harche, F., Polyhedral Study of the Capacitated Vehicle Routing Problem. Mathematical Programming 60, 21, 1993","journal-title":"Mathematical Programming"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s101070050092","volume":"86","author":"C. Cordier","year":"1999","unstructured":"Cordier, C., Marchand, H., Laundy, R., and Wolsey, L.A.: bc-opt: A Branchand-Cut Code for Mixed Integer Programs. Mathematical Programming 86, 335, 1999","journal-title":"Mathematical Programming"},{"key":"6_CR27","unstructured":"Common Optimization INterface for Operations Research (COIN). \u29c4nalty\/z@\/\/www.coin-or.org"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H. Crowder","year":"1980","unstructured":"Crowder, H., and Padberg, M.: Solving Large Scale Symmetric Traveling Salesman Problems to Optimality. Management Science 26, 495, 1980","journal-title":"Management Science"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., and Padberg, M.: Solving Large-Scale Zero-One Linear Programming Problems. Operations Research 31 803, 1983","journal-title":"Operations Research"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230110206","volume":"11","author":"F.H. Cullen","year":"1981","unstructured":"Cullen, F.H., Jarvis, J.J., and Ratli., H.D.: Set Partitioning Based Heuristic for Interactive Routing. Networks 11, 125, 1981","journal-title":"Networks"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1090\/dimacs\/030\/09","volume":"30","author":"V.-D. Cung","year":"1997","unstructured":"Cung, V.-D., Dowaji, S., Le Cun, B., Mauthor, T., and Roucairol, C.: Concurrent Data Structures and Load Balancing Strategies for Parallel Branch and Bound\/A* Algorithms. DIMACS Series in Discrete Optimization and Theoretical Computer Science 30, 141, 1997","journal-title":"DIMACS Series in Discrete Optimization and Theoretical Computer Science"},{"key":"6_CR32","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G.B. Dantzig","year":"1959","unstructured":"Dantzig, G.B, and Ramser, J.H., The Truck Dispatching Problem. Management Science 6, 80, 1959","journal-title":"Management Science"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1137\/0804046","volume":"4","author":"J. Eckstein","year":"1994","unstructured":"Eckstein, J.: Parallel Branch and Bound Algorithms for General Mixed Integer Programming on the CM-5. SIAM Journal on Optimization 4, 794, 1994","journal-title":"SIAM Journal on Optimization"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.9.1.15","volume":"9","author":"J. Eckstein","year":"1997","unstructured":"Eckstein, J.: How Much Communication Does Parallel Branch and Bound Need? INFORMS Journal on Computing 9, 15, 1997","journal-title":"INFORMS Journal on Computing"},{"key":"6_CR35","series-title":"RUTCOR Research Report","doi-asserted-by":"publisher","DOI":"10.2172\/771506","volume-title":"PICO: An Object-Oriented Framework for Parallel Branch and Bound","author":"J. Eckstein","year":"2000","unstructured":"Eckstein, J., Phillips, C.A., and Hart, W.E.: PICO: An Object-Oriented Framework for Parallel Branch and Bound. RUTCOR Research Report 40-2000, Rutgers University, Piscataway, NJ, 2000"},{"key":"6_CR36","unstructured":"Es\u0151, M.: Parallel Branch and Cut for Set Partitioning. Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, NY, 1999"},{"key":"6_CR37","first-page":"141","volume":"42","author":"M.L. Fisher","year":"1988","unstructured":"Fisher, M.L.: Optimal Solution of Vehicle Routine Problems Using Minimum k-Trees. Operations Research 42, 141, 1988","journal-title":"Operations Research"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L., and Jaikumar, R.: A Generalized Assignment Heuristic for Solving the VRP. Networks 11, 109, 1981","journal-title":"Networks"},{"key":"6_CR39","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1057\/jors.1976.63","volume":"27","author":"B.A. Foster","year":"1976","unstructured":"Foster, B.A., and Ryan, D.M.: An Integer Programming Approach to the Vehicle Scheduling Problem, Operational Research Quarterly 27, 367, 1976","journal-title":"Operational Research Quarterly"},{"key":"6_CR40","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., and Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, 1979"},{"key":"6_CR41","volume-title":"Integer Programming","author":"R.S. GarFInkel","year":"1972","unstructured":"GarFInkel, R.S., and Nemhauser, G.L.: Integer Programming. Wiley, New York, 1972"},{"key":"6_CR42","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5712.001.0001","volume-title":"PVM: Parallel Virtual Machine, A User\u2019s Guide and Tutorial for Networked Parallel Computing","author":"A. Geist","year":"1994","unstructured":"Geist, A., et al.: PVM: Parallel Virtual Machine, A User\u2019s Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge, MA, 1994"},{"key":"6_CR43","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B. Gendron","year":"1994","unstructured":"Gendron, B., and Crainic, T.G.: Parallel Branch and Bound Algorithms: Survey and Synthesis. Operations Research 42, 1042, 1994","journal-title":"Operations Research"},{"key":"6_CR44","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1989","unstructured":"Golub, G.H., and Van Loan, C.F.: Matrix Computations. The Johns Hopkins University Press, Baltimore, 1989"},{"key":"6_CR45","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., and Reinelt, G.: A Cutting Plane Algorithm for the Linear Ordering Problem. Operations Research 32, 1155, 1984","journal-title":"Operations Research"},{"key":"6_CR46","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1287\/ijoc.7.4.365","volume":"7","author":"A. Grama","year":"1995","unstructured":"Grama, A., and Kumar, V.: Parallel Search Algorithms for Discrete Optimization Problems. ORSA Journal on Computing 7, 365, 1995","journal-title":"ORSA Journal on Computing"},{"key":"6_CR47","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/42411.42415","volume":"31","author":"J.L. Gustafson","year":"1988","unstructured":"Gustafson, J.L.: Re-evaluating Amdahl\u2019s Law. Comm. of the ACM 31, 532, 1988","journal-title":"Comm. of the ACM"},{"key":"6_CR48","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1969","unstructured":"Held, M., and Karp, R.M.: The Traveling Salesman Problem and Minimal Spanning Trees. Operations Research 18, 1138, 1969","journal-title":"Operations Research"},{"key":"6_CR49","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02022040","volume":"4","author":"K. Hoffman","year":"1985","unstructured":"Hoffman, K., and Padberg, M.: LP-Based Combinatorial Problem Solving. Annals of Operations Research 4, 145, 1985\/6","journal-title":"Annals of Operations Research"},{"key":"6_CR50","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K. Hoffman","year":"1993","unstructured":"Hoffman, K., and Padberg, M.: Solving Airline Crew Scheduling Problems by Branch-and-cut. Management Science 39, 657, 1993","journal-title":"Management Science"},{"key":"6_CR51","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M. J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., and Thienel, S.: The ABACUS System for Branch and Cut and Price Algorithms in Integer Programming and Combinatorial Optimization. Software Practice and Experience 30, 1325, 2000","journal-title":"Software Practice and Experience"},{"key":"6_CR52","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0167-6377(98)00013-3","volume":"22","author":"M. J\u00fcnger","year":"1998","unstructured":"J\u00fcnger, M., and Thienel, S.: Introduction to ABACUS-a branch-and-cut system. Operations Research Letters 22, 83, 1998","journal-title":"Operations Research Letters"},{"key":"6_CR53","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Reinelt, G., and Thienel, S.: Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 111, 1995","DOI":"10.1090\/dimacs\/020\/02"},{"key":"6_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4400-4","volume-title":"The Design and Analysis of Algorithms","author":"D.C. Kozen","year":"1992","unstructured":"Kozen, D.C.: The Design and Analysis of Algorithms, Springer-Verlag, New York, 1992"},{"key":"6_CR55","unstructured":"Kopman, L.: A New Generic Separation Algorithm and Its Application to the Vehicle Routing Problem. Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, NY, 1999"},{"key":"6_CR56","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BF01389001","volume":"16","author":"V. Kumar","year":"1987","unstructured":"Kumar, V., and Rao, V.N.: Parallel Depth-first Search. Part II. Analysis. International Journal of Parallel Programming 16, 501, 1987","journal-title":"International Journal of Parallel Programming"},{"key":"6_CR57","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1006\/jpdc.1994.1099","volume":"22","author":"V. Kumar","year":"1994","unstructured":"Kumar, V., and Gupta, A.: Analyzing Scalability of Parallel Algorithms and Architectures. Journal of Parallel and Distributed Computing 22, 379, 1994","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"6_CR58","unstructured":"Lad\u00e1nyi, L.: Parallel Branch and Cut and Its Application to the Traveling Salesman Problem. Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, NY, 1996"},{"key":"6_CR59","first-page":"271","volume":"51","author":"G. Laporte","year":"1981","unstructured":"Laporte, G., and Nobert, Y.: Comb Inequalities for the Vehicle Routing Problem. Methods of Operations Research 51, 271, 1981","journal-title":"Methods of Operations Research"},{"key":"6_CR60","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","volume":"33","author":"G. Laporte","year":"1985","unstructured":"Laporte, G., Nobert, Y., and Desrouchers, M.: Optimal Routing with Capacity and Distance Restrictions. Operations Research 33, 1050, 1985","journal-title":"Operations Research"},{"key":"6_CR61","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1137\/0804016","volume":"4","author":"P. Laursen","year":"1994","unstructured":"Laursen, P.: Can Parallel Branch and Bound without Communication Be Effective? SIAM Journal of Optimization 4, 288, 1994","journal-title":"SIAM Journal of Optimization"},{"key":"6_CR62","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York, 1985"},{"key":"6_CR63","unstructured":"Letchford, A.N., Eglese, R.W., and Lysgaard, J.: Multi-star Inequalities for the Vehicle Routing Problem. Technical Report available at http:\/\/www.lancs.ac.uk\/staff\/letchfoa\/pubs.htm"},{"key":"6_CR64","unstructured":"Linderoth, J.: Topics in Parallel Integer Optimization. Ph.D. Dissertation, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 1998"},{"key":"6_CR65","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/355972.355976","volume":"7","author":"R. Marsten","year":"1981","unstructured":"Marsten, R.: The Design of The XMP Linear Programming Library. ACM Transactions on Mathematical Software 7, 481, 1981","journal-title":"ACM Transactions on Mathematical Software"},{"key":"6_CR66","unstructured":"Martin, A.: Integer Programs with Block Structure. Habilitation Thesis, Technischen Universit\u00e4t Berlin, 1998"},{"key":"6_CR67","unstructured":"Naddef, D., and Rinaldi, G.: Branch and Cut. In Toth, P., and Vigo, D., eds., Vehicle Routing, SIAM, 2000."},{"key":"6_CR68","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., and Ibaraki, T.: Computing Edge Connectivity in Multigraphs and Capacitated Graphs. SIAM Journal of Discrete Mathematics 5, 54, 1992","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"6_CR69","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser, G.L., Savelsbergh, M.W.P., and Sigismondi, G.S.: MINTO, a Mixed INTeger Optimizer. Operations Research Letters 15, 47, 1994","journal-title":"Operations Research Letters"},{"key":"6_CR70","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., and Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York, 1988"},{"key":"6_CR71","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"Padberg, M., and Rinaldi, G.: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Traveling Salesman Problems. SIAM Review 33, 60, 1991","journal-title":"SIAM Review"},{"key":"6_CR72","unstructured":"Radaramanan, R., and Choi, K.: A Branch and Bound Algorithm for Solving the Vehicle Routing Problem. Proceedings of the 8th Annual Conference on Computers and Industrial Engineering, 236."},{"key":"6_CR73","unstructured":"Ralphs, T.K., Kopman, L., Pulleyblank, W.R., and Trotter Jr., L.E.: On the Capacitated Vehicle Routing Problem. Submitted for publication"},{"key":"6_CR74","unstructured":"Ralphs, T.K.: Parallel Branch and Cut for Vehicle Routing. Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, NY, 1995"},{"key":"6_CR75","unstructured":"Ralphs, T.K., SYMPHONY Version 2.8 User\u2019s Guide. Available at \u29c4nalty\/z@\/\/www.branchandcut.org\/SYMPHONY"},{"key":"6_CR76","unstructured":"Ralphs, T.K., and Lad\u00e1nyi, L. Computational Experience with Branch, Cut, and Price. To be submitted."},{"key":"6_CR77","unstructured":"Ralphs, T.K., and Lad\u00e1nyi, L.: SYMPHONY: A Parallel Framework for Branch and Cut. White paper, Rice University, 1999."},{"key":"6_CR78","unstructured":"Ralphs, T.K.: Repository of Vehicle Routing Problem Instances. Available at http:\/\/www.BranchAndCut.org\/VRP"},{"key":"6_CR79","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BF01389000","volume":"16","author":"V.N. Rao","year":"1987","unstructured":"Rao, V.N., and Kumar, V.: Parallel Depth-first Search. Part I. Implementation. International Journal of Parallel Programming 16, 479, 1987","journal-title":"International Journal of Parallel Programming"},{"key":"6_CR80","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-A traveling salesman problem library. ORSA Journal on Computing 3, 376, 1991. Update available at http:\/\/www.crpc.rice.edu\/softlib\/tsplib\/","journal-title":"ORSA Journal on Computing"},{"key":"6_CR81","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0167-6377(93)90050-Q","volume":"13","author":"R. Rushmeier","year":"1993","unstructured":"Rushmeier, R., and Nemhauser, G.L.: Experiments with Parallel Branch and Bound Algorithms for the Set Covering Problem. Operations Research Letters 13, 277, 1993","journal-title":"Operations Research Letters"},{"key":"6_CR82","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M.W.P. Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.W.P.: A Branch-and-Price Algorithm for the Generalized Assignment Problem. Operations Research 45, 831, 1997","journal-title":"Operations Research"},{"key":"6_CR83","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York, 1986"},{"key":"6_CR84","doi-asserted-by":"crossref","unstructured":"Shinano, Y., Higaki, M., and Hirabayashi, R.: Generalized Utility for Parallel Branch and Bound Algorithms. Proceedings of the 1995 Seventh Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, Los Alamitos, CA, 392, 1995","DOI":"10.1109\/SPDP.1995.530710"},{"key":"6_CR85","doi-asserted-by":"crossref","unstructured":"Shinano, Y., Harada, K., and Hirabayashi, R.: Control Schemes in a Generalized Utility for Parallel Branch and Bound. Proceedings of the 1997 Eleventh International Parallel Processing Symposium, IEEE Computer Society Press, Los Alamitos, CA, 621, 1997","DOI":"10.1109\/IPPS.1997.580966"},{"key":"6_CR86","unstructured":"Tsch\u00f6ke, S., and Polzer, T.: Portable Parallel Branch and Bound Library User Manual, Library Version 2.0. Department of Computer Science, University of Paderborn"}],"container-title":["Lecture Notes in Computer Science","Computational Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45586-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:35:14Z","timestamp":1737052514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45586-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428770","9783540455868"],"references-count":86,"URL":"https:\/\/doi.org\/10.1007\/3-540-45586-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}