A new variable neighborhood search approach for solving dynamic memory allocation problem
From MaRDI portal
Publication:4987788
DOI10.2298/YJOR161015018IzbMath1460.90211OpenAlexW2807741348MaRDI QIDQ4987788
Dragan Urošević, Marija Ivanović, Aleksandar Savić, Djordje Dugošija
Publication date: 4 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/yjor161015018i
combinatorial optimizationmeta-heuristicsvariable neighborhood searchdynamic memory allocation problem
Applications of graph theory (05C90) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical model and a metaheuristic approach for a memory allocation problem
- Variable neighbourhood search: methods and applications
- Variable neighborhood search
- Iterative approaches for a dynamic memory allocation problem in embedded systems
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
- Variable Neighborhood Search
- New variable neighbourhood search based 0-1 MIP heuristics
- Variable neighborhood search: Principles and applications