{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:27:23Z","timestamp":1738214843099,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540779025"},{"type":"electronic","value":"9783540779032"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77903-2_24","type":"book-chapter","created":{"date-parts":[[2008,3,19]],"date-time":"2008-03-19T09:48:02Z","timestamp":1205920082000},"page":"153-158","source":"Crossref","is-referenced-by-count":2,"title":["Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Jella","family":"Pfeiffer","sequence":"first","affiliation":[]},{"given":"Franz","family":"Rothlauf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P. C. Chu","year":"1998","unstructured":"P. C. Chu and J. E. Beasley. A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics, 4(1):63\u201386, 1998.","journal-title":"Journal of Heuristics"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"J. E. Gallardo, C. Cotta, and A. J. Fern\u00e1ndez. Solving the multidimensional knapsack problem using an evolutionary algorithm hybridized with branch and bound. In Proc. of IWINAC-2005:21\u201330, 2005.","DOI":"10.1007\/11499305_3"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Y. Guo, A. Lim, B. Rodrigues, and Y. Zhu. A non-exact approach and experiment studies on the combinatorial auction problem. In Proc. of HICSS-38:82\u201389, 2005.","DOI":"10.1109\/HICSS.2005.34"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"R. C. Holte. Combinatorial auctions, knapsack problems, and hill-climbing search. In E. Stroulia and S. Matwin, editors, Canadian Conference on AI:57\u201366. Springer, 2001.","DOI":"10.1007\/3-540-45153-6_6"},{"key":"24_CR5","unstructured":"H. H. Hoos and C. Boutilier. Solving combinatorial auctions using stochastic local search. In Proc. of AAAI-00:22\u201329. AAAI, 2000."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"24_CR7","unstructured":"G. Raidl. Weight-codings in a genetic algorithm for the multiconstraint knapsack problem. In Proc. of CEC99:596\u2013603. IEEE Press, 1999."},{"issue":"4","key":"24_CR8","first-page":"441","volume":"13","author":"G. Raidl","year":"2005","unstructured":"G. Raidl and J. Gottlieb. Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. ECJ, 13(4):441\u2013475, 2005.","journal-title":"ECJ"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1162\/106365603322519288","volume":"11","author":"F. Rothlauf","year":"2003","unstructured":"F. Rothlauf and D. E. Goldberg. Redundant representations in evolutionary computation. Evolutionary Computation, 11(4):381\u2013415, 2003.","journal-title":"Evolutionary Computation"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Y. Sakurai, M. Yokoo, and K. Kamei. An efficient approximate algorithm for winner determination in combinatorial auctions. InProc. of EC-00:30\u201337, 2000.","DOI":"10.1145\/352871.352875"},{"issue":"4","key":"24_CR11","first-page":"226","volume":"32","author":"J. Thiel","year":"1994","unstructured":"J. Thiel and S. Voss. Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms. INFOR, 32(4):226\u2013242, 1994.","journal-title":"INFOR"},{"key":"24_CR12","first-page":"328","volume":"-01","author":"M. Vasquez","year":"2001","unstructured":"M. Vasquez and J.-K. Hao. A hybrid approach for the multidimensional 0\u20131 knapsack problem. In Proc. of IJCAI-01:328\u2013333, 2001.","journal-title":"Proc. of IJCAI"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"E. Zurel and N. Nisan. An efficient approximate allocation algorithm for combinatorial auctions. In Proc. of EC-01:125\u2013136. ACM, 2001.","DOI":"10.1145\/501158.501172"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77903-2_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:55:25Z","timestamp":1619520925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77903-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540779025","9783540779032"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77903-2_24","relation":{},"subject":[]}}