A local branching heuristic for solving a Graph Edit Distance Problem
Year of publication: |
2019
|
---|---|
Authors: | Darwiche, Mostafa ; Conte, Donatello ; Raveaux, Romain ; T'kindt, Vincent |
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. 106.2019, p. 225-235
|
Subject: | Graph Edit Distance | Graph Matching | Local branching heuristic | Graphentheorie | Graph theory | Heuristik | Heuristics |
-
Çelik, Melih, (2019)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Thevenin, Simon, (2017)
- More ...
-
Deep Graph Matching Meets Mixed-Integer Linear Programming : Relax at Your Own Risk?
Xu, Zhoubo, (2021)
-
Shang, Lei, (2019)
-
Improving the preemptive bound for the single machine dynamic maximum lateness problem
Della Croce, Federico, (2010)
- More ...