iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/978-3-319-45117-6_22
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:50:22Z","timestamp":1725864622222},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319451169"},{"type":"electronic","value":"9783319451176"}],"license":[{"start":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T00:00:00Z","timestamp":1473897600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-45117-6_22","type":"book-chapter","created":{"date-parts":[[2016,9,14]],"date-time":"2016-09-14T03:51:25Z","timestamp":1473825085000},"page":"243-254","source":"Crossref","is-referenced-by-count":2,"title":["Transportation Planning with Forwarding Limitations"],"prefix":"10.1007","author":[{"given":"Mario","family":"Ziebuhr","sequence":"first","affiliation":[]},{"given":"Herbert","family":"Kopfer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2003.08.067","volume":"165","author":"C-W Chu","year":"2005","unstructured":"Chu C-W (2005) A heuristic algorithm for the truckload and less-than truckload problem. Eur J Oper Res 165(3):657\u2013667","journal-title":"Eur J Oper Res"},{"issue":"2","key":"22_CR2","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/j.ejor.2008.06.042","volume":"197","author":"M Krajewska","year":"2009","unstructured":"Krajewska M, Kopfer H (2009) Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem. Eur J Oper Res 197(2):741\u2013751","journal-title":"Eur J Oper Res"},{"key":"22_CR50","unstructured":"Li H, Lim A (2001) A metaheuristic for solving the pickup and delivery problem with time windows. In: IEEE Computer Society (ed) Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI). IEEE Computer Society, Los Alamitos, California: 160\u2013167"},{"issue":"6","key":"22_CR3","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"M L\u00fcbbecke","year":"2004","unstructured":"L\u00fcbbecke M, Desrosiers J (2004) Selected topics in column generation. Oper Res 53(6):1007\u20131023","journal-title":"Oper Res"},{"issue":"1","key":"22_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.1100.0327","volume":"45","author":"O\u00d6 \u00d6zener","year":"2011","unstructured":"\u00d6zener O\u00d6, Ergun \u00d6, Savelsbergh M (2011) Lane-exchange mechanisms for truckload carrier collaboration. Transp Sci 45(1):1\u201317","journal-title":"Transp Sci"},{"issue":"4","key":"22_CR5","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472","journal-title":"Transp Sci"},{"volume-title":"Operational freight carrier planning","year":"2005","author":"J Sch\u00f6nberger","key":"22_CR6","unstructured":"Sch\u00f6nberger J (2005) Operational freight carrier planning. Springer, Berlin, Heidelberg"},{"issue":"2","key":"22_CR7","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s00291-013-0331-x","volume":"36","author":"X Wang","year":"2014","unstructured":"Wang X, Kopfer H (2014) Collaborative transportation planning of less-than truckload freight. OR Spectrum 36(2):357\u2013380","journal-title":"OR Spectrum"},{"issue":"3","key":"22_CR8","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1016\/j.ejor.2014.02.056","volume":"237","author":"X Wang","year":"2014","unstructured":"Wang X, Kopfer H, Gendreau M (2014) Operational transportation planning of freight forwarding companies in horizontal coalitions. Eur J Oper Res 237(3):1133\u20131141","journal-title":"Eur J Oper Res"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Ziebuhr M, Kopfer H (2014) The integrated operational transportation planning problem with compulsory requests. In: Gonzlez-Ramrez RG et al (eds) Computational logistics. Lecture notes in computer science, vol 8760. Springer, Berlin, Heidelberg, pp 1\u201315","DOI":"10.1007\/978-3-319-11421-7_1"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Ziebuhr M, Kopfer H (2016): Collaborative transportation planning with forwarding limitations. In: Accepted for publication in Operation research proceedings 2015. Springer","DOI":"10.1007\/978-3-319-42902-1_19"}],"container-title":["Lecture Notes in Logistics","Dynamics in Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45117-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T13:04:21Z","timestamp":1568379861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45117-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,15]]},"ISBN":["9783319451169","9783319451176"],"references-count":11,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-319-45117-6_22","relation":{},"ISSN":["2194-8917","2194-8925"],"issn-type":[{"type":"print","value":"2194-8917"},{"type":"electronic","value":"2194-8925"}],"subject":[],"published":{"date-parts":[[2016,9,15]]}}}