A variable depth neighborhood search algorithm for the Min-Max Arc Crossing Problem
Year of publication: |
2021
|
---|---|
Authors: | Wu, Xinyun ; Xiong, Caiquan ; Deng, Na ; Xia, Dahai |
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. 134.2021, p. 1-17
|
Subject: | Graph drawing | Incremental evaluation strategy | Meta-heuristic | Min–Max arc crossing problem | Variable depth search | Algorithmus | Algorithm | Heuristik | Heuristics | Graphentheorie | Graph theory |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Kheirkhah, Amir Saman, (2018)
-
Thevenin, Simon, (2017)
- More ...
-
Dual-neighborhood iterated local search for routing and wavelength assignment
Lü, Zhipeng, (2023)
-
A fast vertex weighting-based local search for finding minimum connected dominating sets
Wu, Xinyun, (2022)
-
Dual-Neighborhood Iterated Local Search for Routing and Wavelength Assignment
Lü, Zhipeng, (2023)
- More ...