Maximum weighted induced forests and trees : new formulations and a computational comparative review
Year of publication: |
2022
|
---|---|
Authors: | Melo, Rafael A. ; Ribeiro, Celso C. |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 29.2022, 4, p. 2263-2287
|
Subject: | branch-and-cut | combinatorial optimization | feedback vertex set | induced subgraphs | mixed integer programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Forstwirtschaft | Forestry |
-
Silva, Allyson, (2021)
-
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Gadegaard, Sune Lauth, (2019)
-
Exact approaches for the minimum subgraph diameter problem
Dadalto, Arthur Pratti, (2023)
- More ...
-
Maximum weighted induced forests and trees : new formulations and a computational comparative review
Melo, Rafael A., (2021)
-
The traveling tournament problem with predefined venues
Melo, Rafael A., (2009)
-
Melo, Rafael A., (2021)
- More ...