{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T03:24:54Z","timestamp":1770693894703,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Commerce Research"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1023\/a:1011589804040","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T05:55:34Z","timestamp":1040622934000},"page":"221-238","source":"Crossref","is-referenced-by-count":39,"title":["Computational Aspects of Clearing Continuous Call Double Auctions with Assignment Constraints and Indivisible Demand"],"prefix":"10.1007","volume":"1","author":[{"given":"Jayant R.","family":"Kalagnanam","sequence":"first","affiliation":[]},{"given":"Andrew J.","family":"Davenport","sequence":"additional","affiliation":[]},{"given":"Ho S.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"336556_CR1","volume-title":"Network Flows","author":"K. Ahuja","year":"1993","unstructured":"Ahuja, K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows. Englewood Cliffs, NJ: Prentice-Hall."},{"issue":"2","key":"336556_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/S0097539791221529","volume":"24","author":"J. Cheriyan","year":"1995","unstructured":"Cheriyan, J. and T. Hagerup. (1995). \u201cA Randomized Maximum-Flow Algorithm.\u201d SIAM Journal of Computing 24(2), 203\u2013226.","journal-title":"SIAM Journal of Computing"},{"issue":"6","key":"336556_CR3","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1137\/S0097539791278376","volume":"25","author":"J. Cheriyan","year":"1996","unstructured":"Cheriyan, J., T. Hagerup, and K. Melhorn. (1996). \u201cAn o(n3)-Time Maximum Flow Algorithm.\u201d SIAM Journal of Computing 25(6), 1144\u20131170.","journal-title":"SIAM Journal of Computing"},{"key":"336556_CR4","series-title":"Technical Report","volume-title":"Combinatorial Auctions: A Survey","author":"S. de Vries","year":"2000","unstructured":"de Vries, S. and R. Vohra. (2000). \u201cCombinatorial Auctions: A Survey.\u201d Technical Report, Department of Managerial Economics and Decision Sciences, Kellog School of Management, Northwestern University, Evanston, IL."},{"key":"336556_CR5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"E. Edmonds","year":"1972","unstructured":"Edmonds, E. and R.M. Karp. (1972). \u201cTheoretical Improvements in Algorithmic Efficiency for Network Flow Problems.\u201d Journal of the ACM 19, 248\u2013264.","journal-title":"Journal of the ACM"},{"key":"336556_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman."},{"issue":"1","key":"336556_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/game.1997.0576","volume":"22","author":"S. Gjerstad","year":"1998","unstructured":"Gjerstad, S. and J. Dickhaut. (1998). \u201cPrice Formation in Double Auctions.\u201d Games and Economic Behavior 22(1), 1\u201329.","journal-title":"Games and Economic Behavior"},{"key":"336556_CR8","volume-title":"Knapsack Problems","author":"S. Martello","year":"1989","unstructured":"Martello, S. and P. Toth. (1989). Knapsack Problems. New York: Wiley."},{"key":"336556_CR9","unstructured":"Salman, F.S., J.R. Kalagnanam, S. Murthy, and A.J. Davenport. (2000). \u201cCooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem.\u201d Journal of Heuristics, to appear."},{"key":"336556_CR10","volume-title":"Proceedings of IJCAI '99","author":"T. Sandholm","year":"1999","unstructured":"Sandholm, T. (1999). \u201cAn Algorithm for OptimalWinner Determination in Combinatorial Auctions.\u201d In Proceedings of IJCAI '99. San Mateo, CA: Morgan Kaufmann."},{"key":"336556_CR11","unstructured":"Varian, H.R. (1984). Microeconomic Analysis. W.W. Norton."}],"container-title":["Electronic Commerce Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011589804040.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011589804040\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011589804040.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T05:15:41Z","timestamp":1753852541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011589804040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["336556"],"URL":"https:\/\/doi.org\/10.1023\/a:1011589804040","relation":{},"ISSN":["1389-5753","1572-9362"],"issn-type":[{"value":"1389-5753","type":"print"},{"value":"1572-9362","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}