{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:20:16Z","timestamp":1758273616763},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2013,10,31]],"date-time":"2013-10-31T00:00:00Z","timestamp":1383177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s00500-013-1157-9","type":"journal-article","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T01:56:25Z","timestamp":1383098185000},"page":"1515-1527","source":"Crossref","is-referenced-by-count":8,"title":["GRASP with ejection chains for the dynamic memory allocation in embedded systems"],"prefix":"10.1007","volume":"18","author":[{"given":"Marc","family":"Sevaux","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Rossi","sequence":"additional","affiliation":[]},{"given":"Mar\u00eda","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Mart\u00ed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,31]]},"reference":[{"issue":"5","key":"1157_CR1","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 (2002) VLSI architecture for a low-power video codec system. Microelectron J 33(5):417\u2013427","journal-title":"Microelectron J"},{"issue":"1","key":"1157_CR2","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 (2006) A formal method for hardware IP design and integration under I\/O and timing constraints. ACM Trans Embed Comput Syst 5(1):29\u201353","journal-title":"ACM Trans Embed Comput Syst"},{"issue":"3","key":"1157_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/net.20418","volume":"58","author":"A Duarte","year":"2011","unstructured":"Duarte A, Mart\u00ed R, Resende MGC, Silva RMA (2011) Grasp with path relinking heuristics for the antibandwidth problem. Networks 58(3):171\u2013189","journal-title":"Networks"},{"key":"1157_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67\u201371","journal-title":"Oper Res Lett"},{"key":"1157_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","journal-title":"J Glob Optim"},{"key":"1157_CR6","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 (1997) Tabu search. Kluwer Academic Publishers, New York"},{"issue":"5","key":"1157_CR7","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 (2003) Power consumption modeling and characterization of the TI C6201. IEEE Micro 23(5):40\u201349","journal-title":"IEEE Micro"},{"key":"1157_CR8","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan B (1973) An effective heuristic algorithm for the traveling salesman problem. Operat Res 21:498\u2013516","journal-title":"Operat Res"},{"key":"1157_CR9","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1007\/s10732-012-9213-7","volume":"18","author":"M Lozano","year":"2012","unstructured":"Lozano M, Duarte A, Gortzar F, Mart\u00ed R (2012) Variable neighborhood search with ejection chains for the antibandwidth problem. J Heuristics 18:919\u2013938","journal-title":"J Heuristics"},{"issue":"1","key":"1157_CR10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1287\/ijoc.1080.0275","volume":"21","author":"R Mart\u00ed","year":"2009","unstructured":"Mart\u00ed R, Duarte A, Laguna M (2009) Advanced scatter search for the max-cut problem. INFORMS J Comput 21(1):26\u201338","journal-title":"INFORMS J Comput"},{"key":"1157_CR11","doi-asserted-by":"crossref","unstructured":"Mart\u00ed R, Pantrigo JJ, Duarte A, Campos V (2011) Scatter search and path relinking: a tutorial on the linear arrangement problem. Int J Swarm Intell Res 2(2):1\u201321","DOI":"10.4018\/jsir.2011040101"},{"key":"1157_CR12","unstructured":"Porumbel D (2009) DIMACS graphs: benchmark instances and best upper bound."},{"key":"1157_CR13","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"MGC Resende","year":"2010","unstructured":"Resende MGC, Mart\u00ed R, Gallego M, Duarte A (2010) Grasp and path relinking for the max\u2013min diversity problem. Comput Operat Res 37:498\u2013508","journal-title":"Comput Operat Res"},{"key":"1157_CR14","unstructured":"Resende MGC, Ribeiro CC (2010) Handbook of Metaheuristics. In: Potvin JY, Gendrau M (eds) Greedy randomized adaptive search procedures, 2nd edn. Kluwer Academic Publishers, New York, pp 283\u2013320"},{"key":"1157_CR15","unstructured":"Soto M, Rossi A, Sevaux M (2010) M\u00e9taheuristiques pour l\u2019allocation de m\u00e9moire dans les syst\u00e8mes embarqu\u00e9s. In: Proceedings of ROADEF 11e congr\u00e8s de la soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationelle est d\u2019Aide \u00e0 la D\u00e9cision. Toulouse, France, pp 35\u201343"},{"issue":"1","key":"1157_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10732-011-9165-3","volume":"18","author":"M Soto","year":"2011","unstructured":"Soto M, Rossi A, Sevaux M (2011) A mathematical model and a metaheuristic approach for a memory allocation problem. Journal of Heuristics 18(1):149\u2013167","journal-title":"Journal of Heuristics"},{"key":"1157_CR17","doi-asserted-by":"crossref","unstructured":"Soto M, Rossi A, Sevaux M (2011) Two iterative metaheuristic approaches to dynamic memory allocation for embedded systems. In: Merz P, Hao JK (eds) Evolutionary computation in combinatorial optimization\u201411th European Conference, EvoCOP 2011, Torino, Italy. Proceedings, vol 6622 of Lecture Notes in Computer Science Springer, 250\u2013261","DOI":"10.1007\/978-3-642-20364-0_22"},{"key":"1157_CR18","doi-asserted-by":"crossref","unstructured":"Wuytack S, Catthoor F, Nachtergaele L, De Man H (1996) Power exploration for data dominated video application. In: Proceedings of IEEE International Symposium on Low Power Electronics and Design. Monterey, USA, pp 359\u2013364","DOI":"10.1109\/LPE.1996.547539"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1157-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-013-1157-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1157-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T10:49:41Z","timestamp":1564570181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-013-1157-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,31]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["1157"],"URL":"https:\/\/doi.org\/10.1007\/s00500-013-1157-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,31]]}}}