{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T06:46:57Z","timestamp":1768718817149,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,7,14]],"date-time":"2005-07-14T00:00:00Z","timestamp":1121299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s10107-005-0611-6","type":"journal-article","created":{"date-parts":[[2005,7,14]],"date-time":"2005-07-14T16:41:47Z","timestamp":1121359307000},"page":"365-390","source":"Crossref","is-referenced-by-count":76,"title":["Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem"],"prefix":"10.1007","volume":"106","author":[{"given":"Hande","family":"Yaman","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,14]]},"reference":[{"key":"611_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.37.2.153.15243","volume":"37","author":"Achuthan","year":"2003","unstructured":"Achuthan, N.R., Caccetta, L., Hill, S.P.: An improved branch and cut algorithm for the capacitated vehicle routing problem. Transportation Science 37, 153\u2013169 (2003)","journal-title":"Transportation Science"},{"key":"611_CR2","unstructured":"Araque, J.R., Hall, L.A., Magnanti, T.L.: Capacitated trees capacitated routing and associated polyhedra. Discussion paper, Center for Operations Research and Econometrics, Catholic University of Louvain, Belgium, 1990"},{"key":"611_CR3","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Mathematical Programming 8, 146\u2013164 (1975)","journal-title":"Mathematical Programming"},{"key":"611_CR4","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"Baldacci","year":"2004","unstructured":"Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research 52, 723\u2013738 (2004)","journal-title":"Operations Research"},{"key":"611_CR5","unstructured":"Christof, T.: PORTA - a POlyhedron Representation Transformation Algorithm. Version 1.3.2 available at http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/PORTA\/ 1999"},{"key":"611_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0305-0548(91)90028-P","volume":"18","author":"Desrochers","year":"1991","unstructured":"Desrochers, M., Verhoog, T.W.: A new heuristic for the fleet size and mix vehicle routing problem. Computers & Operations Research 18, 263\u2013274 (1991)","journal-title":"Computers & Operations Research"},{"key":"611_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"Desrochers","year":"1991","unstructured":"Desrochers, M., Laporte, G.: Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 10, 27\u201336 (1991)","journal-title":"Operations Research Letters"},{"key":"611_CR8","unstructured":"Fisher, M.: Vehicle routing. In: M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser (eds) Handbooks in OR MS, Vol. 8, Elsevier Science, 1995"},{"key":"611_CR9","unstructured":"Gavish, B., Graves, S.C.: The traveling salesman problem and related problems. Working Paper 7905, Graduate School of Management, University of Rochester, Rochester, 1979"},{"key":"611_CR10","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/S0305-0548(98)00100-2","volume":"26","author":"Gendreau","year":"1999","unstructured":"Gendreau, M., Laporte, G., Musaraganyi, C., Taillard, E.D.: A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research 26, 1153\u20131173 (1999)","journal-title":"Computers & Operations Research"},{"key":"611_CR11","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BFb0121103","volume":"26","author":"Gheysens","year":"1986","unstructured":"Gheysens, F., Golden, B., Assad, A.: A new heuristic for determining fleet size and composition. Mathematical Programming Study 26, 233\u2013236 (1986)","journal-title":"Mathematical Programming Study"},{"key":"611_CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"Golden","year":"1984","unstructured":"Golden, B., Assad, A., Levy, L., Gheysens, F.: The fleet size and mix vehicle routing problem. Computers & Operations Research 11, 49\u201366 (1984)","journal-title":"Computers & Operations Research"},{"key":"611_CR13","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/0377-2217(94)00025-8","volume":"85","author":"Gouveia","year":"1995","unstructured":"Gouveia, L.: A result on projection for the vehicle routing problem. European Journal of Operational Research 85, 610\u2013624 (1995)","journal-title":"European Journal of Operational Research"},{"key":"611_CR14","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0377-2217(97)00358-5","volume":"112","author":"Gouveia","year":"1999","unstructured":"Gouveia, L., Pires, J.M.: The asymmetric traveling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints. European Journal of Operational Research 112, 134\u2013146 (1999)","journal-title":"European Journal of Operational Research"},{"key":"611_CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"Hammer","year":"1975","unstructured":"Hammer, P.L., Johnson, E.L., Peled, U.N.: Facets of regular 0\u20131 polytopes. Mathematical Programming 8, 179\u2013206 (1975)","journal-title":"Mathematical Programming"},{"key":"611_CR16","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0377-2217(03)00377-1","volume":"158","author":"Kara","year":"2004","unstructured":"Kara, I., Laporte, G., Bektas, T.: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. European Journal of Operational Research 158, 793\u2013795 (2004)","journal-title":"European Journal of Operational Research"},{"key":"611_CR17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(90)90052-7","volume":"9","author":"Langevin","year":"1990","unstructured":"Langevin, A., Soumis, F., Desrosiers, J.: Classification of traveling salesman problem formulations. Operations Research Letters 9, 127\u2013132 (1990)","journal-title":"Operations Research Letters"},{"key":"611_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59, 345\u2013358 (1992)","journal-title":"European Journal of Operational Research"},{"key":"611_CR19","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","volume":"61","author":"Laporte","year":"1995","unstructured":"Laporte, G., Osman, I.H.: Routing problems: A bibliography. Annals of Operations Research 61, 227\u2013262 (1995)","journal-title":"Annals of Operations Research"},{"key":"611_CR20","unstructured":"Letchford, A.N., Salazar-Gonzalez, J.J.: Projection results for vehicle routing. To appear in Mathematical Programming"},{"key":"611_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-002-0336-8","volume":"94","author":"Letchford","year":"2002","unstructured":"Letchford, A.N., Eglese, R.W., Lysgaard, J.: Multistars partial multistars and the capacitated vehicle routing problem. Mathematical Programming 94, 21\u201340 (2002)","journal-title":"Mathematical Programming"},{"key":"611_CR22","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch and cut algorithm for the capacitated vehicle routing problem. Mathematical Programming 100, 423\u2013445 (2004)","journal-title":"Mathematical Programming"},{"key":"611_CR23","unstructured":"Mazur, D.R.: Integer programming approaches to a multi-facility location problem. Ph.D. Thesis, John Hopkins University, 1999"},{"key":"611_CR24","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"Miller","year":"1960","unstructured":"Miller, C., Tucker, A., Zemlin, R.: Integer programming formulations and traveling salesman problems. Journal of ACM 7, 326\u2013329 (1960)","journal-title":"Journal of ACM"},{"key":"611_CR25","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01582894","volume":"52","author":"Padberg","year":"1991","unstructured":"Padberg, M., Sung, T.Y.: An analytical comparison of different formulations of the traveling salesman problem. Mathematical Programming 52, 315\u2013357 (1991)","journal-title":"Mathematical Programming"},{"key":"611_CR26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(95)90600-K","volume":"59","author":"Pochet","year":"1995","unstructured":"Pochet, Y., Wolsey, L.A.: Integer knapsack and flow covers with divisible coefficients: Polyhedra optimization and separation. Discrete Applied Mathematics 59, 57\u201374 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"611_CR27","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/S0377-2217(01)00237-5","volume":"140","author":"Renaud","year":"2002","unstructured":"Renaud, J., Boctor, F.F.: A sweep-based algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research 140, 618\u2013628 (2002)","journal-title":"European Journal of Operational Research"},{"key":"611_CR28","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/0305-0483(92)90009-V","volume":"20","author":"Salhi","year":"1992","unstructured":"Salhi, v., Sari, M., Saidi, D., Touati, N.A.C.: Adaptation of some vehicle fleet mix heuristics. OMEGA 20, 653\u2013660 (1992)","journal-title":"OMEGA"},{"key":"611_CR29","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0377-2217(93)90220-H","volume":"66","author":"Salhi","year":"1993","unstructured":"Salhi, S., Rand, G.K.: Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operational Research 66, 313\u2013330 (1993)","journal-title":"European Journal of Operational Research"},{"key":"611_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"Taillard","year":"1999","unstructured":"Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33, 1\u201314 (1999)","journal-title":"RAIRO"},{"key":"611_CR31","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/S0166-218X(01)00351-1","volume":"123","author":"Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: Models relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics 123, 487\u2013512 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"611_CR32","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Philadelphia, 2002","DOI":"10.1137\/1.9780898718515"},{"key":"611_CR33","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1057\/palgrave.jors.2601344","volume":"53","author":"Wassan","year":"2002","unstructured":"Wassan, N.A., Osman, I.H.: Tabu search variants for the mix fleet vehicle routing problem. Journal of the Operational Research Society 53, 768\u2013782 (2002)","journal-title":"Journal of the Operational Research Society"},{"key":"611_CR34","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"8","year":"1975","unstructured":"Wolsey L.: Faces for a linear inequality in 0\u20131 variables. Mathematical Programming 8, 165\u2013178 (1975)","journal-title":"Mathematical Programming"},{"key":"611_CR35","unstructured":"Yaman, H.: The integer knapsack cover polyhedron. Working Paper"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0611-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0611-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0611-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:58Z","timestamp":1559123398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0611-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,14]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["611"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0611-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7,14]]}}}