{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:37Z","timestamp":1759638277441},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021572"},{"type":"electronic","value":"9783642021589"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02158-9_8","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T15:36:06Z","timestamp":1245252966000},"page":"68-84","source":"Crossref","is-referenced-by-count":1,"title":["Efficiently Generating k-Best Solutions to Procurement Auctions"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Byde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terence","family":"Kelly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunhong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: Proc. 4th Int\u2019l Conf. on Multi-Agent Systems (ICMAS), pp. 39\u201346 (July 2000)","DOI":"10.1109\/ICMAS.2000.858429"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1150735.1150739","volume":"6","author":"T. Kelly","year":"2006","unstructured":"Kelly, T., Byde, A.: Generating k-best solutions to auction winner determination problems. ACM SIGecom Exchanges\u00a06(1), 23\u201334 (2006); Presents an inefficient generation algorithm and extensive experimental results; see [18] and the present paper for an efficient algorithm","journal-title":"ACM SIGecom Exchanges"},{"issue":"8","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M.H. Rothkopf","year":"1998","unstructured":"Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science\u00a044(8), 1131\u20131147 (1998)","journal-title":"Management Science"},{"key":"8_CR4","series-title":"LNAI","volume-title":"Agent-Mediated Electronic Commerce VI. Theories for and Engineering of Distributed Mechanisms and Systems","author":"T. Kelly","year":"2006","unstructured":"Kelly, T.: Generalized knapsack solvers for multi-unit combinatorial auctions. In: Faratin, P., Rodr\u00edguez-Aguilar, J.-A. (eds.) AMEC 2004. LNCS (LNAI), vol.\u00a03435. Springer, Heidelberg (2006); Also available as HP Labs TR HPL-2004-21"},{"key":"8_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)"},{"key":"8_CR6","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing\u00a028(2), 652\u2013673 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR8","unstructured":"Beckett, J.: The business of bidding: Reinventing auctions for better results (September 2005), http:\/\/www.hpl.hp.com\/news\/2005\/jul-sep\/auctions.html"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik\u00a01, 83\u201389 (1959)","journal-title":"Numerische Mathematik"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.ejor.2004.01.032","volume":"165","author":"D. Villeneuve","year":"2005","unstructured":"Villeneuve, D., Desaulniers, G.: The shortest path problem with forbidden paths. European Journal of Operations Research\u00a0165, 97\u2013107 (2005)","journal-title":"European Journal of Operations Research"},{"key":"8_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0377-2217(86)90092-5","volume":"25","author":"M. Henig","year":"1985","unstructured":"Henig, M.: The shortest path problem with two objective functions. European Journal of Operational Research\u00a025(2), 281\u2013291 (1985)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A. Warburton","year":"1987","unstructured":"Warburton, A.: Approximation of Pareto optima in multiple-objective, shortest-path problems. Operations Research\u00a035(1), 70\u201379 (1987)","journal-title":"Operations Research"},{"volume-title":"Combinatorial Auctions","year":"2006","key":"8_CR14","unstructured":"Cramton, P., Shoham, Y., Steinberg, R. (eds.): Combinatorial Auctions, ch.\u00a010. MIT Press, Cambridge (2006)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Lahaie, S.M., Parkes, D.C.: Applying learning algorithms to preference elicitation. In: Proc. ACM E-Commerce Conf., 180\u2013188 (May 2004)","DOI":"10.1145\/988772.988800"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Boutilier, C., Sandholm, T., Shields, R.: Eliciting bid-taker non-price preferences in (combinatorial) auctions. In: Proc. AAAI (2004)","DOI":"10.7551\/mitpress\/9780262033428.003.0011"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0305-0548(98)00094-X","volume":"26","author":"J. Coutinho-Rodrigues","year":"1999","unstructured":"Coutinho-Rodrigues, J., Climaco, J., Current, J.: An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Computers & Operations Research\u00a026, 789\u2013798 (1999)","journal-title":"Computers & Operations Research"},{"key":"#cr-split#-8_CR18.1","unstructured":"Byde, A., Kelly, T.: Efficiently generating k-best solutions for procurement auctions. Technical Report HPL-2006-145, HP Labs (October 2006);"},{"key":"#cr-split#-8_CR18.2","unstructured":"Presents a more efficient generation algorithm than that of [2]"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02158-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:38:13Z","timestamp":1558395493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02158-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021572","9783642021589"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02158-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}