{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T18:28:45Z","timestamp":1724869725504},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T00:00:00Z","timestamp":1195084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10878-007-9109-x","type":"journal-article","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T20:43:05Z","timestamp":1195072985000},"page":"214-234","source":"Crossref","is-referenced-by-count":2,"title":["An extension of the relaxation algorithm for solving a\u00a0special case of capacitated arc routing problems"],"prefix":"10.1007","volume":"17","author":[{"given":"Saman","family":"Eskandarzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Tavakkoli-Moghaddam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Azaron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,15]]},"reference":[{"issue":"1","key":"9109_CR1","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti C, Speranza MG, Hertz A (2006a) A tabu search algorithm for split delivery vehicle routing problem. Transp Sci 40(1):64\u201373","journal-title":"Transp Sci"},{"issue":"2","key":"9109_CR2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/trsc.1050.0117","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti C, Savelsbergh MWP, Speranza MG (2006b) Worst-case analysis for split delivery vehicle routing problems. Transp Sci 40(2):226\u2013234","journal-title":"Transp Sci"},{"key":"9109_CR3","volume-title":"Network routing: handbook in operations research and management science, vol\u00a08","year":"1995","unstructured":"Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds) (1995) Network routing: handbook in operations research and management science, vol\u00a08. Elsevier Science\/North-Holland, Amsterdam"},{"issue":"3","key":"9109_CR4","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Salvelsbergh MWP, Vance PH (1998) Branch and price: column generation for solving huge integer programs. Oper Res 46(3):316\u2013329","journal-title":"Oper Res"},{"key":"9109_CR5","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/S0305-0548(02)00046-1","volume":"30","author":"JM Belenguer","year":"2003","unstructured":"Belenguer JM, Benavent E (2003) A cutting plane algorithm for capacitated arc routing problem. Comput Oper Res 30:705\u2013728","journal-title":"Comput Oper Res"},{"issue":"5","key":"9109_CR6","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1287\/opre.48.5.801.12407","volume":"48","author":"JM Belenguer","year":"2000","unstructured":"Belenguer JM, Martinez MC, Mota E (2000) A lower bound for the split delivery vehicle routing problem. Oper Res 48(5):801\u2013810","journal-title":"Oper Res"},{"key":"9109_CR7","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1016\/j.cor.2005.02.009","volume":"33","author":"JM Belenguer","year":"2006","unstructured":"Belenguer JM, Benavent E, Lacomme P, Prins C (2006) Lower and upper bounds for mixed capacitated arc routing problem. Comput Oper Res 33:3363\u20133383","journal-title":"Comput Oper Res"},{"issue":"2","key":"9109_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01586087","volume":"32","author":"DP Bertsekas","year":"1985","unstructured":"Bertsekas DP (1985) A unified framework for primal-dual methods in minimum cost network flow problems. Math Program 32(2):125\u2013145","journal-title":"Math Program"},{"key":"9109_CR9","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1995","unstructured":"Bertsekas DP (1995) Nonlinear programming. Athena Scientific, Belmont"},{"issue":"4","key":"9109_CR10","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1002\/net.20181","volume":"49","author":"SI Chen","year":"2007","unstructured":"Chen SI, Golden B, Wasil E (2007) The split delivery vehicle routing problem: applications, algorithms, test problems and computational results. Networks 49(4):318\u2013329","journal-title":"Networks"},{"key":"9109_CR11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"1989","unstructured":"Dror M, Trudeau P (1989) Savings by split delivery routing. Transp Sci 23:141\u2013145","journal-title":"Transp Sci"},{"key":"9109_CR12","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1002\/nav.3800370304","volume":"37","author":"M Dror","year":"1990","unstructured":"Dror M, Trudeau P (1990) Split delivery routing. Nav Res Logist 37:383\u2013402","journal-title":"Nav Res Logist"},{"key":"9109_CR13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(92)00172-I","volume":"50","author":"M Dror","year":"1994","unstructured":"Dror M, Laporte G, Trudeau P (1994) Vehicle routing with split deliveries. Discrete Appl Math 50:239\u2013254","journal-title":"Discrete Appl Math"},{"key":"9109_CR14","first-page":"101","volume":"9","author":"PW Frizzell","year":"1992","unstructured":"Frizzell PW, Giffin JW (1992) The bounded split vehicle routing problem with grid networks distances. Asia Pac J Oper Res 9:101\u2013116","journal-title":"Asia Pac J Oper Res"},{"key":"9109_CR15","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/0305-0548(94)00040-F","volume":"22","author":"PW Frizzell","year":"1995","unstructured":"Frizzell PW, Giffin JW (1995) The split delivery vehicle scheduling problem with time windows and grid network distance. Comput Oper Res 22:655\u2013667","journal-title":"Comput Oper Res"},{"key":"9109_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex analysis and minimization algorithm I","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty JB, Lemarechal C (1993) Convex analysis and minimization algorithm I. Springer, Berlin"},{"key":"9109_CR17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","volume":"131","author":"P Lacomme","year":"2004","unstructured":"Lacomme P, Prins C, Ramdane-Cherif W (2004) Competitive memtic algorithms for arc routing problems. Ann Oper Res 131:159\u2013185","journal-title":"Ann Oper Res"},{"key":"9109_CR18","doi-asserted-by":"crossref","first-page":"1823","DOI":"10.1016\/j.cor.2004.11.020","volume":"33","author":"H Longo","year":"2006","unstructured":"Longo H, Poggi de Aragao M, Uchoa E (2006) Solving capacitated arc routing problems using a transformation to the CVRP. Comput Oper Res 33:1823\u20131837","journal-title":"Comput Oper Res"},{"key":"9109_CR19","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.ijpe.2006.04.014","volume":"105","author":"J Mingzhou","year":"2007","unstructured":"Mingzhou J, Kai L, Bowden RO (2007) A two stage algorithm with valid inequalities for the split delivery vehicle routing problem. Int J Prod Econ 105:228\u2013242","journal-title":"Int J Prod Econ"},{"key":"9109_CR20","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1057\/palgrave.jors.2600338","volume":"48","author":"PA Mullaseril","year":"1997","unstructured":"Mullaseril PA, Dror M, Leung J (1997) Split delivery routing heuristics in livestock feed distribution. J\u00a0Oper Res Soc 48:107\u2013116","journal-title":"J\u00a0Oper Res Soc"},{"key":"9109_CR21","unstructured":"Nowak MA (2005) The pickup and delivery problem with split loads. PhD thesis, Georgia Institute of Technology"},{"key":"9109_CR22","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton"},{"key":"9109_CR23","first-page":"327","volume-title":"Nonlinear programming, vol\u00a04","author":"RT Rockafellar","year":"1981","unstructured":"Rockafellar RT (1981) Monotropic programming: descent algorithms and duality. In: Mangasarian OL, Meyer R, Robinson S (eds) Nonlinear programming, vol\u00a04. Academic Press, New York, pp\u00a0327\u2013366"},{"key":"9109_CR24","volume-title":"Network flows and monotropic programming","author":"RT Rockafellar","year":"1983","unstructured":"Rockafellar RT (1983) Network flows and monotropic programming. Wiley-Interscience, New York"},{"key":"9109_CR25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1018900705946","volume":"76","author":"G Sierksma","year":"1998","unstructured":"Sierksma G, Tijssen GA (1998) Routing helicopters for crew exchange on off-shore locations. Ann Oper Res 76:261\u2013286","journal-title":"Ann Oper Res"},{"key":"9109_CR26","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0360-8352(02)00077-3","volume":"43","author":"SH Song","year":"2002","unstructured":"Song SH, Lee KS, Kim GS (2002) A practical approach to solving a newspaper logistics problem using a digital map. Comput Ind Eng 43:315\u2013330","journal-title":"Comput Ind Eng"},{"issue":"4","key":"9109_CR27","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/moor.12.4.569","volume":"12","author":"P Tseng","year":"1987","unstructured":"Tseng P, Bertsekas DP (1987) Relaxation methods for linear programs. Math Oper Res 12(4):569\u2013596","journal-title":"Math Oper Res"},{"key":"9109_CR28","unstructured":"Vanderbeck F (1994) Decomposition and column generation for integer programs. PhD thesis, Universite Catholique de Louvain, Belguim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9109-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9109-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9109-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:12Z","timestamp":1559276292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9109-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,15]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["9109"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9109-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,15]]}}}