Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
Year of publication: |
2021
|
---|---|
Authors: | Santos, Vinícius Gandra Martins ; Carvalho, Marco Antonio Moreira de |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 289.2021, 3 (16.3.), p. 1056-1066
|
Subject: | Combinatorial optimization | Heuristics | Cutwidth | Graph layout | Adaptive large nighborhood search | Heuristik | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory |
-
Strong SDP based bounds on the cutwidth of a graph
Gaar, Elisabeth, (2024)
-
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan, (2014)
-
Laforest, Christian, (2013)
- More ...
-
Turkeš, Renata, (2019)
-
A breadth-first search applied to the minimization of the open stacks
Carvalho, Marco Antonio Moreira de, (2015)
-
New models for the Mirrored Traveling Tournament Problem
Carvalho, Marco Antonio Moreira de, (2012)
- More ...