{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T11:08:24Z","timestamp":1772190504766,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,7,15]],"date-time":"2012-07-15T00:00:00Z","timestamp":1342310400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s00291-012-0302-7","type":"journal-article","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T14:33:29Z","timestamp":1346510009000},"page":"281-296","source":"Crossref","is-referenced-by-count":14,"title":["Solving elementary shortest-path problems as mixed-integer programs"],"prefix":"10.1007","volume":"36","author":[{"given":"Michael","family":"Drexl","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Irnich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,15]]},"reference":[{"key":"302_CR1","unstructured":"Ahuja R, Magnanti T, Orlin J (1993) Network flows. Prentice-Hall, Upper Saddle River"},{"issue":"3","key":"302_CR2","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1016\/j.ejor.2008.04.037","volume":"196","author":"J Ar\u00e1oz","year":"2009","unstructured":"Ar\u00e1oz J, Fern\u00e1ndez E, Meza O (2009) Solving the prize-collecting rural postman problem. Eur J Oper Res 196(3): 886\u2013896. doi: 10.1016\/j.ejor.2008.04.037","journal-title":"Eur J Oper Res"},{"key":"302_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur J Oper Res 218: 1\u20136","journal-title":"Eur J Oper Res"},{"issue":"1","key":"302_CR4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.orl.2004.11.011","volume":"34","author":"N Boland","year":"2006","unstructured":"Boland N, Dethridge J, Dumitrescu I (2006) Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper Res Lett 34(1): 58\u201368","journal-title":"Oper Res Lett"},{"key":"302_CR5","unstructured":"Boost (2012) Boost graph library. http:\/\/www.boost.org"},{"issue":"4","key":"302_CR6","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1287\/trsc.1090.0279","volume":"43","author":"T Crainic","year":"2009","unstructured":"Crainic T, Ricciardi N, Storchi G (2009) Models for evaluating and planning city logistics systems. Transp Sci 43(4): 432\u2013454. doi: 10.1287\/trsc.1090.0279","journal-title":"Transp Sci"},{"key":"302_CR7","doi-asserted-by":"crossref","unstructured":"Desaulniers G, Desrosiers J, Ioachim I, Solomon M, Soumis F, Villeneuve D (1998) A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Crainic T, Laporte G (eds) Fleet management and logistics. Kluwer, Boston, pp 57\u201393","DOI":"10.1007\/978-1-4615-5755-5_3"},{"key":"302_CR8","doi-asserted-by":"crossref","unstructured":"Drexl M (2012) Synchronization in vehicle routing\u2014a survey of VRPs with multiple synchronization constraints. Transp Sci. doi: 10.1287\/trsc.1110.0400","DOI":"10.1287\/trsc.1110.0400"},{"issue":"2","key":"302_CR9","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Transp Sci 39(2): 188\u2013205. doi: 10.1287\/trsc.1030.0079","journal-title":"Transp Sci"},{"issue":"3","key":"302_CR10","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R Fukasawa","year":"2006","unstructured":"Fukasawa R, Longo H, Lysgaard J, Poggide Arago M, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program Ser A 106(3): 491\u2013511","journal-title":"Math Program Ser A"},{"key":"302_CR11","doi-asserted-by":"crossref","unstructured":"Golden B, Raghavan S, Wasil E (eds) (2008) The vehicle routing problem: latest advances and new challenges. Operations research\/computer science interfaces series, vol 43. Springer, Berlin","DOI":"10.1007\/978-0-387-77778-8"},{"key":"302_CR12","unstructured":"Gutin G, Punnen A (eds) (2002) The traveling salesman problem and its variations. Kluwer, Dordrecht"},{"issue":"3","key":"302_CR13","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1111\/j.1475-3995.2008.00681.x","volume":"16","author":"M Ibrahim","year":"2009","unstructured":"Ibrahim M, Maculan N, Minoux M (2009) A strong flow-based formulation for the shortest path problem in digraphs with negative cycles. Int Trans Oper Res 16(3): 361\u2013369. doi: 10.1111\/j.1475-3995.2008.00681.x","journal-title":"Int Trans Oper Res"},{"key":"302_CR14","doi-asserted-by":"crossref","unstructured":"Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Desaulniers G, Desrosiers J, Solomon M (eds) Column generation. Springer, New York, pp 33\u201365","DOI":"10.1007\/0-387-25486-2_2"},{"issue":"3","key":"302_CR15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/ijoc.1040.0117","volume":"18","author":"S Irnich","year":"2006","unstructured":"Irnich S, Villeneuve D (2006) The shortest path problem with resource constraints and k-cycle elimination for k \u2265\u00a0 3. INFORMS J Comput 18(3): 391\u2013406","journal-title":"INFORMS J Comput"},{"key":"302_CR16","unstructured":"Jepsen M, Petersen B, Spoorendonk S (2008) A branch-and-cut algorithm for the elementary shortest path problem with a capacity constraint. Technical report 08\/01, Department of Computer Science, University of Copenhagen"},{"issue":"3","key":"302_CR17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini G, Salani M (2006) Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim 3(3): 255\u2013273. doi: 10.1016\/j.disopt.2006.05.007","journal-title":"Discrete Optim"},{"key":"302_CR18","unstructured":"Skorobohatyj G (1999) Finding a minimum cut between all pairs of nodes in an undirected graph. http:\/\/elib.zib.de\/pub\/Packages\/mathprog\/mincut\/all-pairs\/index.html . Accessed 25 April 2012"},{"key":"302_CR19","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (eds) (2002) The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia","DOI":"10.1137\/1.9780898718515"},{"key":"302_CR20","unstructured":"Wayne K (2008) Union-find algorithms. http:\/\/www.cs.princeton.edu\/~rs\/AlgsDS07\/01UnionFind.pdf . Accessed 25 April 2012"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-012-0302-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-012-0302-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-012-0302-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T07:00:03Z","timestamp":1559026803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-012-0302-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,15]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["302"],"URL":"https:\/\/doi.org\/10.1007\/s00291-012-0302-7","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,15]]}}}