Multistart search for the cyclic cutwidth minimization problem
Year of publication: |
2021
|
---|---|
Authors: | Cavero, Sergio ; Pardo, Eduardo G. ; Laguna, Manuel ; Duarte, Abraham |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 126.2021, p. 1-18
|
Subject: | Cyclic cutwidth | Graph layout problem | Circular embedding | Tabu Search | Multistart search | Konjunktur | Business cycle | Heuristik | Heuristics | Suchtheorie | Search theory | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Tabu search for the cyclic bandwidth problem
Rodriguez-Tello, Eduardo, (2015)
-
Thevenin, Simon, (2017)
-
The maximum happy induced subgraph problem : bounds and algorithms
Lewis, Rhyd, (2021)
- More ...
-
Efficient iterated greedy for the two-dimensional bandwidth minimization problem
Cavero, Sergio, (2023)
-
Scatter search for the cutwidth minimization problem
Pantrigo, Juan J., (2012)
-
Branch and bound for the cutwidth minimization problem
MartÃ, Rafael, (2013)
- More ...