New formulations and branch-and-cut procedures for the longest induced path problem
| Year of publication: |
2022
|
|---|---|
| Authors: | Marzo, Ruslán G. ; Melo, Rafael A. ; Ribeiro, Celso C. ; Santos, Marcio C. |
| 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. 139.2022, p. 1-11
|
| Subject: | Combinatorial optimization | Integer programming | Longest induced path | Maximum induced subgraphs | Maximum cardinality | Theorie | Theory | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Total coloring and total matching : polyhedra and facets
Ferrarini, Luca, (2022)
-
The in-house logistics routing problem
Fabri, Marcelus, (2023)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
- More ...
-
Interian, Ruben, (2023)
-
Maximum weighted induced forests and trees : new formulations and a computational comparative review
Melo, Rafael A., (2022)
-
Melo, Rafael A., (2025)
- More ...