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 | Theorie | Theory | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Boosting ant colony optimization via solution prediction and machine learning
Sun, Yuan, (2022)
-
Niroomand, Sadegh, (2015)
-
Ying, Kuo-ching, (2012)
- More ...
-
Multi-Documents Summarization Based on TextRank and its Application in Online Argumentation Platform
Xiong, Caiquan, (2018)
-
A matheuristic for a telecommunication network design problem with traffic grooming
Wu, Xinyun, (2019)
-
Dual-neighborhood iterated local search for routing and wavelength assignment
Lü, Zhipeng, (2023)
- More ...