{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T10:10:55Z","timestamp":1648548655024},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10732-005-0389-y","type":"journal-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T16:37:05Z","timestamp":1119976625000},"page":"147-173","source":"Crossref","is-referenced-by-count":7,"title":["Bid Evaluation in Procurement Auctions with Piecewise Linear Supply Curves"],"prefix":"10.1007","volume":"11","author":[{"given":"Marta","family":"Eso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soumyadip","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayant","family":"Kalagnanam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laszlo","family":"Ladanyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"389_CR1","unstructured":"Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall."},{"issue":"3","key":"389_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance. (1998). \u201cBranch-and-Price: Column Generation for Huge Integer Programs.\u201d Operations Research 46(3), 316\u2013329.","journal-title":"Operations Research"},{"key":"389_CR3","unstructured":"\u201cCOIN-OR: Common Optimization Interface for Operations Research,\u201d http:\/\/www.coin-or.org."},{"key":"389_CR4","doi-asserted-by":"crossref","unstructured":"Davenport, A. and J. Kalagnanam. (2002). \u201cPrice negotiations for procurement of direct inputs.\u201d Brenda Dietrich and Rakesh V. Vohra, eds., In Proceedings of the IMA Workshop Mathematics of the Internet: e-Auctions and Markets. Springers, New York City, NY.","DOI":"10.1007\/978-1-4684-9277-4_3"},{"issue":"3","key":"389_CR5","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S. De Vries","year":"2003","unstructured":"De Vries, S. and R. Vohra. (2003). \u201cCombinatorial Auctions: A Survey.\u201d INFORMS Journal on Computing 15(3), 284\u2013309.","journal-title":"INFORMS Journal on Computing"},{"key":"389_CR6","unstructured":"(2001). \u201cB2B Exchanges: Time to Rebuild.\u201d The Economist, 55\u201356."},{"key":"389_CR7","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman."},{"key":"389_CR8","unstructured":"ILOG. (1999). ILOG CPLEX 6.5 User\u2019s Manual."},{"key":"389_CR9","unstructured":"Ladanyi, L., J.J. Forrest, and J. Kalagnanam. (2001). \u201cA Column Generation Approach to the Multiple Knapsack Problem with Color Contraints.\u201d IBM Research Report RC 22013."},{"key":"389_CR10","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. New York: John Wiley & Sons."},{"key":"389_CR11","unstructured":"Mehlhorn, K. and S. N\u00e4her. (1999) LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press."},{"key":"389_CR12","unstructured":"Sandholm, T. and S. Suri. (2001). \u201cMarket Clearability. IJCAI-01.\u201d In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Seattle, Washington, pp. 1145\u20131151."},{"key":"389_CR13","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M.W.P. Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.W.P. (1997). \u201cA Branch-and-Price Algorithm for the Generalized Assignment Problem.\u201d Operations Research 45, 831\u2013841.","journal-title":"Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-0389-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-005-0389-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-0389-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:26Z","timestamp":1559242466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-005-0389-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["389"],"URL":"https:\/\/doi.org\/10.1007\/s10732-005-0389-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}