{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:55:57Z","timestamp":1725486957225},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72845-0_33","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T12:51:37Z","timestamp":1182862297000},"page":"433-445","source":"Crossref","is-referenced-by-count":0,"title":["Exact Algorithms for the Matrix Bid Auction"],"prefix":"10.1007","author":[{"given":"Dries R.","family":"Goossens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/11427186_21","volume-title":"Experimental and Efficient Algorithms","author":"Y. Bleischwitz","year":"2005","unstructured":"Bleischwitz, Y., Kliewer, G.: Accelerating Vickrey payment computation in combinatorial auctions for an airline alliance. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 228\u2013239. Springer, Heidelberg (2005)"},{"key":"33_CR2","unstructured":"Day, R.W.: Expressing preferences with price-vector agents in combinatorial auctions. PhD thesis, University of Maryland (2004)"},{"key":"33_CR3","unstructured":"Day, R.W., Raghavan, S.: Matrix bidding in combinatorial auctions. Manuscript (2006)"},{"key":"33_CR4","unstructured":"Goossens, D.: Exact methods for combinatorial auctions. PhD thesis, K.U. Leuven (2006)"},{"issue":"2","key":"33_CR5","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.ejor.2006.03.010","volume":"178","author":"D. Goossens","year":"2007","unstructured":"Goossens, D., Maas, A.J.T., Spieksma, F.C.R., van de Klundert, J.J.: Exact algorithms for procurement problems under a total quantity discount structure. European Journal of Operational Research\u00a0178(2), 603\u2013626 (2007)","journal-title":"European Journal of Operational Research"},{"key":"33_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M.L. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M.L., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)"},{"key":"33_CR7","unstructured":"Hoos, H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: AAAI\/IAAI \u201900: Proceedings of the 17th national conference on artificial intelligence and 12th conference on innovative applications of artificial intelligence, Austin, USA, pp. 22\u201329. AAAI Press\/The MIT Press (2000)"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V. Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching is max snp-complete. Information Processing Letters\u00a037(1), 27\u201335 (1991)","journal-title":"Information Processing Letters"},{"key":"33_CR9","unstructured":"Leyton-Brown, K., Shoham, Y., Tennenholtz, M.: An algorithm for multi-unit combinatorial auctions. In: AAAI\/IAAI \u201900: Proceedings of the 17th national conference on artificial intelligence and 12th conference on innovative applications of artificial intelligence, Austin, USA, pp. 56\u201361. AAAI Press \/ The MIT Press, (2000)"},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"479","DOI":"10.7551\/mitpress\/9780262033428.003.0020","volume-title":"Combinatorial auctions","author":"K. Leyton-Brown","year":"2005","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Empirical hardness models for combinatorial auctions. In: Cramton, P., Steinberg, R., Shoham, Y. (eds.) Combinatorial auctions, pp. 479\u2013504. MIT Press, Cambridge (2005)"},{"key":"33_CR11","doi-asserted-by":"crossref","first-page":"451","DOI":"10.7551\/mitpress\/9780262033428.003.0019","volume-title":"Combinatorial auctions","author":"K. Leyton-Brown","year":"2005","unstructured":"Leyton-Brown, K., Shoham, Y.: A test suite for combinatorial auctions. In: Cramton, P., Steinberg, R., Shoham, Y. (eds.) Combinatorial auctions, pp. 451\u2013478. MIT Press, Cambridge (2005)"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/352871.352872","volume-title":"EC \u201900","author":"N. Nisan","year":"2000","unstructured":"Nisan, N.: Bidding and allocation in combinatorial auctions. In: EC \u201900: Proceedings of the 2nd ACM conference on electronic commerce, Minneapolis, USA, pp. 1\u201312. ACM Press, New York (2000)"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/336992.337032","volume-title":"EC \u201999:","author":"D.C. Parkes","year":"1999","unstructured":"Parkes, D.C.: iBundle: an efficient ascending price bundle auction. In: EC \u201999: Proceedings of the ACM conference on electronic commerce, Denver, USA, pp. 148\u2013157. ACM Press, New York (1999)"},{"issue":"2","key":"33_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E. Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: gap location. Computational Complexity\u00a04(2), 133\u2013157 (1994)","journal-title":"Computational Complexity"},{"issue":"8","key":"33_CR15","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M. Rothkopf","year":"1998","unstructured":"Rothkopf, M., Peke\u00e7, A., Harstad, R.M.: Computationally manageable combinational auctions. Management Science\u00a044(8), 1131\u20131147 (1998)","journal-title":"Management Science"},{"key":"33_CR16","unstructured":"Ryan, D., Foster, B.: An integer programming approach to scheduling. In: Wren, A. (ed.) Computer scheduling of public transport: urban passenger vehicle and crew scheduling. North-Holland, pp. 269\u2013280 (1981)"},{"issue":"1-2","key":"33_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"2002","unstructured":"Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence\u00a0135(1-2), 1\u201354 (2002)","journal-title":"Artificial Intelligence"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1287\/mnsc.1040.0336","volume":"51","author":"T. Sandholm","year":"2005","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABOB: a fast optimal algorithm for combinatorial auctions. Management Science\u00a051, 374\u2013390 (2005)","journal-title":"Management Science"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6377(96)00033-8","volume":"19","author":"F. Vanderbeck","year":"1996","unstructured":"Vanderbeck, F., Wolsey, L.: An exact algorithm for ip column generation. Operations Research Letters\u00a019, 151\u2013159 (1996)","journal-title":"Operations Research Letters"},{"issue":"1","key":"33_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1009940607600","volume":"3","author":"S. Hoesel Van","year":"2001","unstructured":"Van Hoesel, S., M\u00fcller, R.: Optimization in electronic markets: examples in combinatorial auctions. Netnomics\u00a03(1), 23\u201333 (2001)","journal-title":"Netnomics"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72845-0_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:05:50Z","timestamp":1605762350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72845-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728443"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72845-0_33","relation":{},"subject":[]}}