{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T19:18:47Z","timestamp":1672427927816},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,29]],"date-time":"2011-03-29T00:00:00Z","timestamp":1301356800000},"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":[[2012,2]]},"DOI":"10.1007\/s10732-011-9165-3","type":"journal-article","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T17:43:09Z","timestamp":1301334189000},"page":"149-167","source":"Crossref","is-referenced-by-count":11,"title":["A mathematical model and a metaheuristic approach for a memory allocation problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Mar\u00eda","family":"Soto","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Rossi","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Sevaux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,29]]},"reference":[{"issue":"2","key":"9165_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.vlsi.2004.08.003","volume":"39","author":"D. Atienza","year":"2006","unstructured":"Atienza, D., Mamagkakis, S., Poletti, F., Mendias, J., Catthoor, F., Benini, L., Soudris, D.: Efficient system-level prototyping of power-aware dynamic memory managers for embedded systems. Integration 39(2), 113\u2013130 (2006)","journal-title":"Integration"},{"key":"9165_CR2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R.: The reactive tabu search. ORSA J. Comput. 6, 126\u2013140 (1994)","journal-title":"ORSA J. Comput."},{"key":"9165_CR3","unstructured":"Black, P.E.: Greedy algorithm. Dictionary of Algorithms and Data Structures, U.S. National Institute of Standards and Technology (2005)"},{"key":"9165_CR4","unstructured":"Bouygues e-lab Innovation & Optimisation. Localsolver 1.0 (2010). http:\/\/e-lab.bouygues.com\/?p=693"},{"issue":"1","key":"9165_CR5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.14.1.52","volume":"14","author":"R.C. Carlson","year":"1966","unstructured":"Carlson, R.C., Nemhauser, G.L.: Scheduling to minimize interaction cost. Oper. Res. 14(1), 52\u201358 (1966)","journal-title":"Oper. Res."},{"key":"9165_CR6","unstructured":"Chiarandini, M., Paquete, A., Preuss, M., Ridge, E.: Experiments on metaheuristics: Methodological overview and open issues. Technical Report DMF-2007-03-003, The Danish Mathematical Society, Denmark (2007)"},{"issue":"5","key":"9165_CR7","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/S0026-2692(02)00009-5","volume":"33","author":"A. Chimientia","year":"2002","unstructured":"Chimientia, A., Fanucci, L., Locatellic, R., Saponarac, S.: VLSI architecture for a low-power video codec system. Microelectron. J. 33(5), 417\u2013427 (2002)","journal-title":"Microelectron. J."},{"key":"9165_CR8","volume-title":"Practical Nonparametric Statistic","author":"W.J. Conover","year":"1999","unstructured":"Conover, W.J.: Practical Nonparametric Statistic, 3rd edn. Wiley, New York (1999)","edition":"3"},{"key":"9165_CR9","first-page":"370","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Greedy algorithms. In: Introduction to Algorithms, 2nd edn., pp.\u00a0370\u2013404. MIT Press, Cambridge (1990)","edition":"2"},{"issue":"1","key":"9165_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1132357.1132359","volume":"5","author":"P. Coussy","year":"2006","unstructured":"Coussy, P., Casseau, E., Bomel, P., Baganne, A., Martin, E.: A formal method for hardware IP design and integration under I\/O and timing constraints. ACM Trans. Embed. Comput. Syst. 5(1), 29\u201353 (2006)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"9165_CR11","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2005)"},{"key":"9165_CR12","unstructured":"FICO. Xpress-MP (2009). http:\/\/www.dashoptimization.com\/"},{"key":"9165_CR13","doi-asserted-by":"crossref","first-page":"675","DOI":"10.2307\/2279372","volume":"32","author":"M. Friedman","year":"1937","unstructured":"Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J. Am. Stat. Assoc. 32, 675\u2013701 (1937)","journal-title":"J. Am. Stat. Assoc."},{"key":"9165_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)"},{"key":"9165_CR15","unstructured":"GNU. GLPK linear programming kit (2009). http:\/\/www.gnu.org\/software\/glpk\/"},{"issue":"4","key":"9165_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Herz","year":"1987","unstructured":"Herz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345\u2013351 (1987)","journal-title":"Computing"},{"issue":"12","key":"9165_CR17","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1109\/12.817403","volume":"48","author":"M. Iverson","year":"1999","unstructured":"Iverson, M., Ozguner, F., Potter, L.: Statistical prediction of task execution times through analytic benchmarking for scheduling in a heterogeneous environment. IEEE Trans. Comput. 48(12), 1374\u20131379 (1999)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"9165_CR18","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MM.2003.1240211","volume":"23","author":"N. Julien","year":"2003","unstructured":"Julien, N., Laurent, J., Senn, E., Martin, E.: Power consumption modeling and characterization of the TI C6201. IEEE MICRO 23(5), 40\u201349 (2003)","journal-title":"IEEE MICRO"},{"key":"9165_CR19","first-page":"1875","volume-title":"Handbook of Combinatorics","author":"A.W.J. Kolen","year":"1995","unstructured":"Kolen, A.W.J., Lenstra, J.K.: Combinatorics in operations research. In: Handbook of Combinatorics, pp.\u00a01875\u20131910. Elsevier, Amsterdam (1995)"},{"issue":"3","key":"9165_CR20","first-page":"237","volume":"28","author":"W. Lee","year":"2002","unstructured":"Lee, W., Chang, M.: A study of dynamic memory management in C++ programs. Comput. Lang. Syst. Struct. 28(3), 237\u2013272 (2002)","journal-title":"Comput. Lang. Syst. Struct."},{"issue":"11","key":"9165_CR21","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighbourhood decomposition search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9165_CR22","unstructured":"Porumbel, D.: DIMACS graphs: Benchmark instances and best upper bound (2009). http:\/\/www.info.univ-angers.fr\/pub\/porumbel\/graphs\/"},{"key":"9165_CR23","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-642-01009-5_11","volume-title":"Proc. of the 9th EvoCOP Conference on Evolutionary Computation in Combinatorial Optimization","author":"D. Porumbel","year":"2009","unstructured":"Porumbel, D., Hao, J.-K., Kuntz, P.: Diversity control and multi-parent recombination for evolutionary graph coloring algorithms. In: Proc. of the 9th EvoCOP Conference on Evolutionary Computation in Combinatorial Optimization, T\u00fcbingen, Germany, pp.\u00a0121\u2013132 (2009)"},{"key":"9165_CR24","series-title":"Combinatorial Optimization","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/0-306-48213-4_8","volume-title":"The Traveling Salesman Problem and Its Variations","author":"C. Rego","year":"2004","unstructured":"Rego, C., Glover, F.: Local search and metaheuristics. In: Du, D.-Z., Pardalos, P.M., Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12, pp.\u00a0309\u2013368. Springer, Berlin (2004)"},{"key":"9165_CR25","first-page":"191","volume-title":"Proc. of the CTW09 Cologne-Twente Workshop on Graphs and Combinatorial Optimization","author":"M. Soto","year":"2009","unstructured":"Soto, M., Rossi, A., Sevaux, M.: Two upper bounds on the chromatic number. In: Proc. of the CTW09 Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, France, vol.\u00a08, pp.\u00a0191\u2013194 (2009)"},{"key":"9165_CR26","first-page":"35","volume-title":"Proc. ROADEF 11eme Congr\u00e8s de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationelle et d\u2019Aide \u00e0 la D\u00e9cision","author":"M. Soto","year":"2010","unstructured":"Soto, M., Rossi, A., Sevaux, M.: M\u00e9taheuristiques pour l\u2019allocation de m\u00e9moire dans les syst\u00e8mes embarqu\u00e9s. In: Proc. ROADEF 11eme Congr\u00e8s de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationelle et d\u2019Aide \u00e0 la D\u00e9cision, Toulouse, France, pp.\u00a035\u201343 (2010)"},{"issue":"1","key":"9165_CR27","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0167-6377(02)00165-7","volume":"31","author":"T. Vredeveld","year":"2003","unstructured":"Vredeveld, T., Lenstra, J.K.: On local search for the generalized graph coloring problem. Oper. Res. Lett. 31(1), 28\u201334 (2003)","journal-title":"Oper. Res. Lett."},{"key":"9165_CR28","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/LPE.1996.547539","volume-title":"Proc. IEEE Symposium on Low Power Design","author":"S. Wuytack","year":"1996","unstructured":"Wuytack, S., Catthoor, F., Nachtergaele, L., De Man, H.: Power exploration for data dominated video application. In: Proc. IEEE Symposium on Low Power Design, Monterey, CA, USA, pp.\u00a0359\u2013364 (1996)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9165-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9165-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9165-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T13:43:03Z","timestamp":1560087783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9165-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,29]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9165"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9165-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,29]]}}}