Stable set reformulations for the degree preserving spanning tree problem
Year of publication: |
2024
|
---|---|
Authors: | Lucena, Abílio ; Cunha, Alexandre Salles da |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 319.2024, 1 (1.11.), p. 50-61
|
Subject: | Branch-and-cut algorithms | Combinatorial benders decomposition | Combinatorial optimization | Degree preserving spanning trees | Stable set | Graphentheorie | Graph theory | Algorithmus | Algorithm | Dekompositionsverfahren | Decomposition method | Mathematische Optimierung | Mathematical programming | Spieltheorie | Game theory | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming |
-
Extended formulations for perfect domination problems and their algorithmic implications
Forte, Vinícius Leal do, (2023)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Cordeau, Jean-François, (2019)
- More ...
-
Gendron, Bernard, (2014)
-
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
Cunha, Alexandre Salles da, (2015)
-
Exact solution algorithms for the chordless cycle problem
Pereira, Dilson Lucas, (2022)
- More ...