A new formulation for the Safe Set problem on graphs
Year of publication: |
2019
|
---|---|
Authors: | Macambira, Ana Flavia Uzeda ; Simonetti, Luidi ; Barbalho, Hugo ; González, Pedro Henrique ; Maculan F., Nelson |
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. 111.2019, p. 346-356
|
Subject: | Safe set problem | Branch-and-cut algorithm | Heuristic | Heuristik | Heuristics | Algorithmus | Algorithm | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming |
-
Incremental network design with shortest paths
Baxter, Matthew, (2014)
-
Exact and heuristic algorithms for the design of hub networks with multiple lines
Martins de Sá, Elisangela, (2015)
-
Locating names on vertices of a transaction network
Alcaide-López-de-Pablo, David, (2017)
- More ...
-
González, Pedro Henrique, (2016)
-
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Lucena, Abílio, (2010)
-
A hybrid data mining GRASP with path-relinking
Barbalho, Hugo, (2013)
- More ...