Integer programming models and polyhedral study for the geodesic classification problem on graphs
Year of publication: |
2024
|
---|---|
Authors: | Araújo, Paulo H. M. ; Campêlo, Manoel ; Corrêa, Ricardo C. ; Labbé, Martine |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 314.2024, 3 (1.5.), p. 894-911
|
Subject: | Classification | Combinatorial optimization | Geodesic convexity | Integer programming | Polyhedral combinatorics | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Klassifikation |
-
The total matching polytope of complete bipartite graphs
Faenza, Yuri, (2024)
-
MIP formulations for induced graph optimization problems : a tutorial
Melo, Rafael A., (2023)
-
Extended formulations for perfect domination problems and their algorithmic implications
Forte, Vinícius Leal do, (2023)
- More ...
-
Two dependency constrained spanning tree problems
Viana, Luiz Alberto do Carmo, (2019)
-
Heuristics for the connected assignment problem in arrays
Campêlo, Manoel, (2019)
-
Integer programming approaches to the multiple team formation problem
Campêlo, Manoel, (2021)
- More ...