A fast path relinking algorithm for the min-max edge crossing problem
Year of publication: |
2024
|
---|---|
Authors: | Peng, Bo ; Wu, Lunwen ; Martí, Rafael ; Ma, Jiangshui |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 166.2024, Art.-No. 106603, p. 1-17
|
Subject: | Dynamic programming | Graph drawing | Metaheuristics | Min–max edge crossing | Path relinking | Algorithmus | Algorithm | Graphentheorie | Graph theory | Dynamische Optimierung |
-
A primal adjacency-based algorithm for the shortest path problem with resource constraints
Himmich, Ilyas, (2020)
-
Optimization problems in graphs with locational uncertainty
Bougeret, Marin, (2023)
-
Multiple hypernode hitting sets and smallest two-cores with targets
Damaschke, Peter, (2009)
- More ...
-
A Fast Path Relinking Algorithm for the Min–Max Edge Crossing Problem
Peng, Bo, (2023)
-
Supply chain coordination with competing suppliers under price-sensitive stochastic demand
Wang, Feng, (2021)
-
Yang, Fu, (2021)
- More ...