{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T23:10:42Z","timestamp":1786144242993,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343066","type":"print"},{"value":"9783540343073","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11757375_6","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T07:59:15Z","timestamp":1148025555000},"page":"44-58","source":"Crossref","is-referenced-by-count":19,"title":["Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs"],"prefix":"10.1007","author":[{"given":"Luca","family":"Benini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Davide","family":"Bertozzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alessio","family":"Guerri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michela","family":"Milano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik\u00a04, 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11564751_11","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"D. Bertozzi","year":"2005","unstructured":"Bertozzi, D., Benini, L., Guerri, A., Milano, M.: Allocation and scheduling for mpsocs via decomposition and no-good generation. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 107\u2013121. Springer, Heidelberg (2005)"},{"key":"6_CR3","first-page":"241","volume":"68","author":"M. Fischetti","year":"1995","unstructured":"Fischetti, M., Balas, E., Pulleyblank, W.: The precedence constrained asymmetric travelling salesman problem. Mathematical Programming\u00a068, 241\u2013265 (1995)","journal-title":"Mathematical Programming"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45578-7_1","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"A. Eremin","year":"2001","unstructured":"Eremin, A., Wallace, M.: Hybrid benders decomposition algorithms in constraint logic programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 1\u201315. Springer, Heidelberg (2001)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"I.E. Grossmann","year":"2001","unstructured":"Grossmann, I.E., Jain, V.: Algorithms for hybrid milp\/cp models for a class of optimization problems. INFORMS Journal on Computing\u00a013, 258\u2013276 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-30201-8_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"J.N. Hooker","year":"2004","unstructured":"Hooker, J.N.: A hybrid method for planning and scheduling. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 305\u2013316. Springer, Heidelberg (2004)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11564751_25","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"J.N. Hooker","year":"2005","unstructured":"Hooker, J.N.: Planning and scheduling to minimize tardiness. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 314\u2013327. Springer, Heidelberg (2005)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Mathematical Programming\u00a096, 33\u201360 (2003)","journal-title":"Mathematical Programming"},{"key":"6_CR9","unstructured":"Poletti, P., Poggiali, A., Marchal, P.: Flexible hardware\/software support for message passing on a distributed shared memory architecture. In: 2005 Design, Automation and Test in Europe Conference and Exposition DATE 2005, pp. 736\u2013741 (2005)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Ruggiero, M., Acquaviva, A., Bertozzi, D., Benini, L.: Application-specific power-aware workload allocation for voltage scalable mpsoc platforms. In: 2005 International Conference on Computer Design, pp. 87\u201393 (2005)","DOI":"10.1109\/ICCD.2005.24"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Ruggiero, M., Guerri, A., Bertozzi, D., Benini, L., Milano, M.: Communication-aware allocation and scheduling framework for stream-oriented multi-processor systems-on-chip. In: 2006 Design, Automation and Test in Europe Conference and Exposition DATE 2006 (2006)","DOI":"10.1109\/DATE.2006.243950"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45578-7_2","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"E.S. Thorsteinsson","year":"2001","unstructured":"Thorsteinsson, E.S.: A hybrid framework integrating mixed integer programming and constraint programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 16\u201330. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11757375_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:14Z","timestamp":1619507054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11757375_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343066","9783540343073"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11757375_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}