{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T09:36:56Z","timestamp":1777628216212,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T00:00:00Z","timestamp":1391817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s12351-014-0141-1","type":"journal-article","created":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T13:54:48Z","timestamp":1391781288000},"page":"361-386","source":"Crossref","is-referenced-by-count":34,"title":["Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests"],"prefix":"10.1007","volume":"14","author":[{"given":"Bo","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoxun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Genke","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,8]]},"reference":[{"key":"141_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann H, Ewe H, Kopfer H, Kufer KH (2011a) Combinatorial auctions in freight logistics. In: Proceedings of the Second international conference on Computational logistics, pp 1\u201317","DOI":"10.1007\/978-3-642-24264-9_1"},{"key":"141_CR2","unstructured":"Ackermann H, Ewe H, K\u00fcfer K-H, Schr\u00f6der M (2011b) Modeling profit sharing in combinatorial exchanges by network flows, ITWM Report. http:\/\/www.itwm.fraunhofer.de\/fileadmin\/ITWM-Media\/Zentral\/Pdf\/Berichte_ITWM\/2011\/bericht_205.pdf"},{"issue":"5","key":"141_CR3","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1016\/j.orl.2008.04.007","volume":"36","author":"R Agarwal","year":"2009","unstructured":"Agarwal R, Ergun O (2009) Mechanism design for a multicommodity flow game in service network alliances. Oper Res Lett 36(5):520\u2013524","journal-title":"Oper Res Lett"},{"key":"141_CR4","first-page":"21","volume-title":"Combinatorial models for multi-agent scheduling problems, multiprocessor scheduling, theory and applications","author":"A Agnetis","year":"2007","unstructured":"Agnetis A, Pacciarelli D, Pacifici A (2007) Combinatorial models for multi-agent scheduling problems, multiprocessor scheduling, theory and applications. I-Tech Education and Publishing, Vienna, pp 21\u201346"},{"issue":"3","key":"141_CR5","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1257\/aer.96.3.602","volume":"96","author":"L Ausubel","year":"2006","unstructured":"Ausubel L (2006) An efficient dynamic auction for heterogeneous commodities. Am Econ Rev 96(3):602\u2013629","journal-title":"Am Econ Rev"},{"issue":"5","key":"141_CR6","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.tre.2009.12.006","volume":"46","author":"S Berger","year":"2010","unstructured":"Berger S, Bierwirth C (2010) Solutions to the request reassignment problem in collaborative carrier networks. Transp Res Part E 46(5):627\u2013638","journal-title":"Transp Res Part E"},{"key":"141_CR7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1017\/CBO9780511800481.013","volume-title":"Algorithmic game theory","author":"L Blumrosen","year":"2007","unstructured":"Blumrosen L, Nisan N (2007) Combinatorial auctions. In: Nisan N, Roughgarden T, Tardos E, Vazirani V (eds) Algorithmic game theory. Cambridge University Press, Cambridge, pp 267\u2013300"},{"key":"141_CR8","unstructured":"Dai B, Chen HX (2009) Mathematical model and solution approach for collaborative logistics in less than truckload (LTL) transportation. 39th International conference on computers and industrial engineering. Troyes, pp 767\u2013772"},{"key":"141_CR9","unstructured":"Dai B, Chen HX (2009b) A Benders decomposition approach for collaborative logistics planning with LTL transportation. The third international conference on operations and supply chain management. Wuhan pp 565\u2013573"},{"issue":"2\u20133","key":"141_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s12159-011-0046-9","volume":"3","author":"B Dai","year":"2011","unstructured":"Dai B, Chen HX (2011) A multi-agent and auction based framework and approach for carrier collaboration. Logist Res 3(2\u20133):101\u2013120","journal-title":"Logist Res"},{"issue":"2","key":"141_CR11","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/j.cie.2011.11.029","volume":"62","author":"B Dai","year":"2012","unstructured":"Dai B, Chen HX (2012) Profit allocation mechanisms for carrier collaboration problem. Comput Ind Eng 62(2):633\u2013643","journal-title":"Comput Ind Eng"},{"issue":"6","key":"141_CR12","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1016\/j.cor.2005.07.026","volume":"34","author":"\u00d6 Ergun","year":"2007","unstructured":"Ergun \u00d6, Kuyzu G, Savelsbergh M (2007a) Shipper collaboration. Comput Oper Res 34(6):1551\u20131560","journal-title":"Comput Oper Res"},{"issue":"2","key":"141_CR13","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/trsc.1060.0169","volume":"41","author":"\u00d6 Ergun","year":"2007","unstructured":"Ergun \u00d6, Kuyzu G, Savelsbergh M (2007b) Reducing truckload transportation costs through collaboration. Transp Sci 41(2):206\u2013221","journal-title":"Transp Sci"},{"issue":"12 Supplement","key":"141_CR14","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","volume":"50","author":"ML Fisher","year":"2004","unstructured":"Fisher ML (2004) The lagrangian relaxation method for solving integer programming problems. Manag Sci 50(12 Supplement):1861\u20131871","journal-title":"Manag Sci"},{"issue":"6","key":"141_CR15","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1016\/j.tre.2011.03.001","volume":"47","author":"S Hernandez","year":"2011","unstructured":"Hernandez S, Peeta S, Kalafatas G (2011) A less-than-truckload carrier collaboration planning problem under dynamic capacities. Transp Res Part E Logist Transp Rev 47(6):933\u2013946","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"141_CR16","unstructured":"Holgu\u00edn-Veras J, Xu N, Jong G, Maurer H (2009) An experimental economics investigation of shipper-carrier interactions in the choice of mode and shipment size in freight transport. Netw Spat Econ. http:\/\/www.springerlink.com\/content\/m2m8h0077h83p102\/"},{"key":"141_CR17","unstructured":"Houghtalen L, Ergun \u00d6, Sokol J (2007) Designing allocation mechanisms for carrier alliances, Unpublished. http:\/\/www.agifors.org\/award\/submissions2007\/Houghtalen_paper.pdf"},{"key":"141_CR18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-1-4020-7953-5_5","volume-title":"Handbook of quantitative supply chain analysis: modeling in the e-business era","author":"J Kalagnanam","year":"2004","unstructured":"Kalagnanam J, Parkes DC (2004) Auction, bidding and exchange design. In: Simchi-Levi D, Wu SD, Shen ZM (eds) Handbook of quantitative supply chain analysis: modeling in the e-business era. Kluwer Academic Publishers, Berlin, pp 143\u2013212"},{"issue":"2","key":"141_CR19","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s00291-005-0031-2","volume":"28","author":"MA Krajewska","year":"2006","unstructured":"Krajewska MA, Kopfer H (2006) Collaborating freight forwarding enterprises: request allocation and profit sharing. OR Spectr 28(2):301\u2013317","journal-title":"OR Spectr"},{"issue":"9","key":"141_CR20","first-page":"813","volume":"31","author":"E Kutanoglu","year":"1999","unstructured":"Kutanoglu E, Wu SD (1999) On combinatorial auction and lagrangean relaxation for distributed resource. IIE Trans 31(9):813\u2013826","journal-title":"IIE Trans"},{"key":"141_CR21","unstructured":"Kwon RH, Lee CG, Ma Z (2005) An integrated combinatorial auction mechanism for truckload transportation procurement. Working paper, Unpublished, University of Toronto, Canada. http:\/\/www.mie.utoronto.ca\/labs\/ilr\/MultiRound.pdf"},{"issue":"2","key":"141_CR22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.tre.2005.01.004","volume":"43","author":"CG Lee","year":"2007","unstructured":"Lee CG, Kwon RH, Ma Z (2007) A carrier\u2019s optimal bid generation problem in combinatorial auctions for transportation procurement. Transp Res Part E 43(2):173\u2013191","journal-title":"Transp Res Part E"},{"issue":"2","key":"141_CR23","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TASE.2005.844221","volume":"2","author":"PB Luh","year":"2005","unstructured":"Luh PB, Yu DQ, Soorapanth S, Khibnik AI, Rajamani R (2005) A Lagrangian relaxation based approach to schedule asset overhaul and repair services. IEEE Trans Autom Sci Eng 2(2):145\u2013157","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"141_CR24","unstructured":"Mes M (2008) Sequential auctions for full truckload allocation. PhD thesis, University of Twente, Enschede, Netherlands"},{"key":"141_CR25","unstructured":"Mes M, Van der Heijden M (2007) Pricing and scheduling strategies for carriers and shippers in sequential transportation auctions. In: Proceedings of the sixth triennial symposium on transportation analysis, Phuket Island"},{"key":"141_CR26","volume-title":"Combinatorial auctions","author":"DC Parkes","year":"2006","unstructured":"Parkes DC (2006) Iterative combinatorial auctions. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial auctions, vol 2. MIT Press, Cambridge"},{"issue":"4","key":"141_CR27","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10257-008-0102-4","volume":"7","author":"M Schwind","year":"2009","unstructured":"Schwind M, Gujo O, Vykoukal J (2009) A combinatorial intra-enterprise exchange for logistics services. IseB 7(4):447\u2013471","journal-title":"IseB"},{"issue":"4","key":"141_CR28","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/inte.1040.0075","volume":"34","author":"Y Sheffi","year":"2004","unstructured":"Sheffi Y (2004) Combinatorial auctions in the procurement of transportation services. Interfaces 34(4):245\u2013252","journal-title":"Interfaces"},{"key":"141_CR29","first-page":"329","volume-title":"Multiagent systems algorithmic, game-theoretic, and logical foundations","author":"Y Shoham","year":"2009","unstructured":"Shoham Y, Brown KL (2009) Multiagent systems algorithmic, game-theoretic, and logical foundations. Cambridge University Press, UK, pp 329\u2013381"},{"issue":"3","key":"141_CR30","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s10957-007-9238-5","volume":"133","author":"T Sun","year":"2007","unstructured":"Sun T, Zhao QC, Luh PB (2007) On the surrogate gradient algorithm for lagrangian relaxation. J Optim Theory Appl 133(3):413\u2013416","journal-title":"J Optim Theory Appl"},{"key":"141_CR31","doi-asserted-by":"crossref","unstructured":"Villahoz JJL, Martinez RO, Arauzo AA, Ordax JMG (2010). Price updating in combinatorial auctions for coordination of manufacturing multiagent systems. 8th International conference on practical applications of agents and multiagent systems, Springer, pp 201\u2013207","DOI":"10.1007\/978-3-642-12433-4_24"},{"issue":"3","key":"141_CR32","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S Vries","year":"2003","unstructured":"Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284\u2013309","journal-title":"INFORMS J Comput"},{"issue":"3","key":"141_CR33","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1023\/A:1022646725208","volume":"100","author":"X Zhao","year":"1999","unstructured":"Zhao X, Luh PB, Wang J (1999) Surrogate gradient algorithm for Lagrangian relaxation. J Optim Theory Appl 100(3):699\u2013712","journal-title":"J Optim Theory Appl"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-014-0141-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-014-0141-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-014-0141-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:30:22Z","timestamp":1565181022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-014-0141-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,8]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["141"],"URL":"https:\/\/doi.org\/10.1007\/s12351-014-0141-1","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,8]]}}}