{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:30:13Z","timestamp":1761888613647,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s13675-013-0012-1","type":"journal-article","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T02:31:07Z","timestamp":1374546667000},"page":"283-312","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem"],"prefix":"10.1016","volume":"1","author":[{"given":"Mounira","family":"Groiez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Desaulniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Hadjar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Odile","family":"Marcotte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1007\/s13675-013-0012-1_CR1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/net.3230170303","article-title":"On some matching problems arising in vehicle scheduling models","volume":"17","author":"Bertossi","year":"1987","journal-title":"Networks"},{"key":"10.1007\/s13675-013-0012-1_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/10556789408805563","article-title":"A set partitioning approach to the multiple depot vehicle scheduling problem","volume":"3","author":"Bianco","year":"1994","journal-title":"Optim Methods Softw"},{"key":"10.1007\/s13675-013-0012-1_CR3","first-page":"46","article-title":"UCOST: a Micro approach to a transit planning problem","volume":"5","author":"Bodin","year":"1978","journal-title":"J Urban Anal"},{"key":"10.1007\/s13675-013-0012-1_CR4","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/net.3230190505","article-title":"A branch and bound algorithm for the multiple vehicle scheduling problem","volume":"19","author":"Carpaneto","year":"1989","journal-title":"Networks"},{"key":"10.1007\/s13675-013-0012-1_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02592196","article-title":"{0,1\/2}-Chv\u00e1tal-Gomory cuts","volume":"74","author":"Caprara","year":"1996","journal-title":"Math programm"},{"key":"10.1007\/s13675-013-0012-1_CR6","doi-asserted-by":"crossref","unstructured":"Desaulniers G, Hickman MD (2007) Public Transit. In: Barnhart C, Laporte G (eds) Handbooks in OR & MS: transportation, vol 14. Elsevier, Amsterdam, pp 69\u2013127","DOI":"10.1016\/S0927-0507(06)14002-5"},{"key":"10.1007\/s13675-013-0012-1_CR7","doi-asserted-by":"crossref","unstructured":"Desrosiers J, Dumas Y, Solomon M, Soumis F (1995) Time constrained routing and scheduling. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds) Handbooks in OR & MS: network routing, vol 8. Elsevier, Amsterdam, pp 35\u2013139","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"10.1007\/s13675-013-0012-1_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math Program"},{"key":"10.1007\/s13675-013-0012-1_CR9","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/mnsc.47.6.833.9810","article-title":"A polyhedral approach to simplified crew scheduling and vehicle scheduling problems","volume":"47","author":"Fischetti","year":"2001","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-013-0012-1_CR10","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s00291-005-0207-9","article-title":"Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice","volume":"27","author":"Gintner","year":"2005","journal-title":"OR Spectr"},{"key":"10.1007\/s13675-013-0012-1_CR11","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.1050.0240","article-title":"A branch-and-cut algorithm for the multiple depot vehicle scheduling problem","volume":"54","author":"Hadjar","year":"2006","journal-title":"Oper Res"},{"key":"10.1007\/s13675-013-0012-1_CR12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/ijoc.1090.0341","article-title":"Path-reduced costs for eliminating arcs in routing and scheduling","volume":"22","author":"Irnich","year":"2010","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-013-0012-1_CR13","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1016\/j.ejor.2005.02.030","article-title":"A time-space network based exact optimization model for multi-depot bus scheduling","volume":"175","author":"Kliewer","year":"2006","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-013-0012-1_CR14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.cie.2008.11.028","article-title":"Iterated local search for the multiple depot vehicle scheduling problem","volume":"57","author":"Laurent","year":"2009","journal-title":"Comput Ind Eng"},{"key":"10.1007\/s13675-013-0012-1_CR15","unstructured":"L\u00f6bel A (1997) Optimal vehicle scheduling in public transit. PhD thesis, Technische Universit\u00e4t Berlin, Berlin"},{"key":"10.1007\/s13675-013-0012-1_CR16","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1287\/mnsc.44.12.1637","article-title":"Vehicle scheduling in public transit and Lagrangean Pricing","volume":"44","author":"L\u00f6bel","year":"1998","journal-title":"Manag Sci"},{"year":"1988","series-title":"Integer and combinatorial optimization","author":"Nemhauser","key":"10.1007\/s13675-013-0012-1_CR17"},{"key":"10.1007\/s13675-013-0012-1_CR18","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","article-title":"A strong cutting plane\/branch-and-bound algorithm for node packing","volume":"43","author":"Nemhauser","year":"1992","journal-title":"J Oper Res Soc"},{"key":"10.1007\/s13675-013-0012-1_CR19","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.cor.2005.05.011","article-title":"Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems","volume":"34","author":"Oukil","year":"2007","journal-title":"Comput OR"},{"key":"10.1007\/s13675-013-0012-1_CR20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","article-title":"Odd minimum cut-sets and b-matchings","volume":"7","author":"Padberg","year":"1982","journal-title":"Math Oper Res"},{"key":"10.1007\/s13675-013-0012-1_CR21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10951-008-0072-x","article-title":"Comparison of Heuristic approaches for the multiple depot vehicle scheduling problem","volume":"12","author":"Pepin","year":"2009","journal-title":"J Sched"},{"key":"10.1007\/s13675-013-0012-1_CR22","doi-asserted-by":"crossref","unstructured":"Pulleyblank WR, Edmonds J (1974) Facets of 1-matching polyhedra. In: Berge C, Ray-Chaudhuri D (eds) Hypergraph seminar. Springer, Berlin, pp 214\u2013242","DOI":"10.1007\/BFb0066196"},{"key":"10.1007\/s13675-013-0012-1_CR23","unstructured":"Rebennack S (2006) Maximum stable set problem: a branch & cut solver. Diploma Thesis, Ruprecht- Karls-Universit\u00e4t Heidelberg, Heidelberg"},{"issue":"41-52","key":"10.1007\/s13675-013-0012-1_CR24","first-page":"1994","article-title":"A column generation approach to the multiple depot vehicle scheduling problem","volume":"42","author":"Ribeiro","year":"1994","journal-title":"Oper Res"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0012-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-013-0012-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000228?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000228?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0012-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:02Z","timestamp":1761882302000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":24,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["S2192440621000228"],"URL":"https:\/\/doi.org\/10.1007\/s13675-013-0012-1","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-013-0012-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}