Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (Q2631232)

scientific article

In more languages

Language	Label	Description	Also known as
English	Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies	scientific article

Statements

Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (English)

29 July 2016

dynamic memory allocation problem

0 references

variable neighborhood search

parallelism

embedded systems

metaheuristics

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.endm.2014.11.012

0 references

cites work

Variable neighborhood search for the vertex separation problem

0 references

Parallel variable neighbourhood search strategies for the cutwidth minimization problem

0 references

The parallel variable neighborhood search for the \(p\)-median problem

0 references

Variable neighbourhood search: methods and applications

0 references

Combining intensification and diversification strategies in VNS. An application to the vertex separation problem

0 references

A mathematical model and a metaheuristic approach for a memory allocation problem

0 references

Identifiers

zbMATH Open document ID

1362.68260

0 references

DOI

10.1016/j.endm.2014.11.012

0 references

Mathematics Subject Classification ID

Sitelinks

Mathematics(1 entry)

mardi Publication:2631232