{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:10:11Z","timestamp":1761977411364,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319007946"},{"type":"electronic","value":"9783319007953"}],"license":[{"start":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T00:00:00Z","timestamp":1385596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T00:00:00Z","timestamp":1385596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-00795-3_43","type":"book-chapter","created":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T03:50:39Z","timestamp":1385524239000},"page":"297-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems"],"prefix":"10.1007","author":[{"given":"Christian","family":"Hinrichs","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Lehnhoff","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Sonnenschein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,28]]},"reference":[{"issue":"1","key":"43_CR1","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2009.04.006","volume":"37","author":"B Han","year":"2010","unstructured":"Han, B., Leblet, J., Simon, G.: Hard multidimensional multiple choice knapsack problems, an empirical study. Computers & Operations Research 37(1), 172\u2013181 (2010). doi:10.1016\/j.cor.2009.04.006","journal-title":"Computers & Operations Research"},{"key":"43_CR2","unstructured":"Hinrichs, C., Vogel, U., Sonnenschein, M.: Approaching Decentralized Demand Side Management via Self-Organizing Agents. In: Yolum, Tumer, Stone, Sonenberg (eds.) ATES Workshop, Proc. of 10th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2011). Taipei, Taiwan (2011)."},{"key":"43_CR3","doi-asserted-by":"publisher","unstructured":"Lust, T., Teghem, J.: The multiobjective multidimensional knapsack problem: a survey and a new approach. International Transactions in Operational Research 19(4), 495\u2013520 (2012). doi:10.1111\/j.1475-3995.2011.00840.x","DOI":"10.1111\/j.1475-3995.2011.00840.x"},{"key":"43_CR4","unstructured":"Martello, S., Toth, P.: Knapsack problems, 1 edn. John Wiley & Sons (1990)."},{"issue":"2","key":"43_CR5","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1109\/TPWRS.2003.821611","volume":"19","author":"N Padhy","year":"2004","unstructured":"Padhy, N.: Unit Commitment-A Bibliographical Survey. IEEE Transactions on Power Systems 19(2), 1196\u20131205 (2004). doi:10.1109\/TPWRS.2003.821611","journal-title":"IEEE Transactions on Power Systems"},{"issue":"2","key":"43_CR6","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0377-2217(95)00015-I","volume":"83","author":"D. Pisinger","year":"1995","unstructured":"Pisinger, D.: A minimal algorithm for the multiple-choice knapsack problem. European Journal of Operational Research 83(2), 394\u2013410 (1995).doi:10.1016\/0377-2217(95)00015-I","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"43_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1999.1034","volume":"33","author":"D Pisinger","year":"1999","unstructured":"Pisinger, D.: Linear Time Algorithms for Knapsack Problems with Bounded Weights. Journal of Algorithms 33(1), 1\u201314 (1999). doi:10.1006\/jagm.1999.1034","journal-title":"Journal of Algorithms"},{"issue":"6825","key":"43_CR8","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz, S.H.: Exploring complex networks. Nature 410(6825), 268\u2013276 (2001). doi:10.1038\/35065725","journal-title":"Nature"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Talbi, E.G.: Metaheuristics. John Wiley & Sons, Inc., Hoboken, NJ, USA (2009). 10.1002\/9780470496916.","DOI":"10.1002\/9780470496916"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2012"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00795-3_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T19:17:42Z","timestamp":1675797462000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00795-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,28]]},"ISBN":["9783319007946","9783319007953"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00795-3_43","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2013,11,28]]},"assertion":[{"value":"28 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}