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 |
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
-
Finding exact solutions for the Geometric Firefighter Problem in practice
Zambon, Mauricio J. O., (2018)
- More ...
-
Cárdenas-Barrón, Leopoldo E., (2021)
-
Melo, Rafael A., (2021)
-
Obtaining the Grundy chromatic number : how bad can my greedy heuristic coloring be?
Silva, Mateus C., (2024)
- More ...