Iterative approaches for a dynamic memory allocation problem in embedded systems

DOI10.1016/j.ejor.2013.05.016zbMath1317.90067OpenAlexW2081559620MaRDI QIDQ2356204

María Soto, Marc Sevaux, André Rossi

Publication date: 29 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.05.016

zbMATH Keywords

metaheuristicsembedded systemsVNSmemory allocation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (2)

A new variable neighborhood search approach for solving dynamic memory allocation problem ⋮ Iterative approaches for a dynamic memory allocation problem in embedded systems

Cites Work

• A mathematical model and a metaheuristic approach for a memory allocation problem
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
• Variable neighborhood search
• A buffer minimization problem for the design of embedded systems
• Optimization approach for data allocation in multidisk database
• A study of dynamic memory management in C++ programs.
• Iterative approaches for a dynamic memory allocation problem in embedded systems

This page was built for publication: Iterative approaches for a dynamic memory allocation problem in embedded systems