Search Results - subject:"Graph layout"

Efficient iterated greedy for the two-dimensional bandwidth minimization problem

Cavero, Sergio; Pardo, Eduardo G.; Duarte, Abraham - In: European journal of operational research : EJOR 306 (2023) 3, pp. 1126-1139

Persistent link: https://www.econbiz.de/10014279719

Multistart search for the cyclic cutwidth minimization problem

Cavero, Sergio; Pardo, Eduardo G.; Laguna, Manuel; … - In: Computers & operations research : and their … 126 (2021), pp. 1-18

Persistent link: https://www.econbiz.de/10012425916

Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem

Santos, Vinícius Gandra Martins; Carvalho, Marco … - In: European journal of operational research : EJOR 289 (2021) 3, pp. 1056-1066

Persistent link: https://www.econbiz.de/10012433598

On a binary distance model for the minimum linear arrangement problem

Reinelt, Gerhard; Seitz, Hanna - In: TOP: An Official Journal of the Spanish Society of … 22 (2014) 1, pp. 384-396

The minimum linear arrangement problem consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is minimized. The problem is among the classical NP-hard optimization problems and there has been extensive research on exact and...

Persistent link: https://www.econbiz.de/10010995361

On a binary distance model for the minimum linear arrangement problem

Reinelt, Gerhard; Seitz, Hanna - In: Top : transactions in operations research 22 (2014) 1, pp. 384-396

Persistent link: https://www.econbiz.de/10010347728