Extended formulations for perfect domination problems and their algorithmic implications
Year of publication: |
2023
|
---|---|
Authors: | Forte, Vinícius Leal do ; Hanafi, Saïd ; Lucena, Abílio |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 310.2023, 2 (16.10.), p. 566-581
|
Subject: | Combinatorial optimization | Computational results | Exact solution algorithms | Mathematical formulations | Perfect graph domination | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming |
-
An exact algorithm for the minimum quartet tree cost problem
Consoli, Sergio, (2019)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Stable set reformulations for the degree preserving spanning tree problem
Lucena, Abílio, (2024)
- More ...
-
A location-allocation model for logistics integration centers
Guimarães, Vanessa de Almeida, (2017)
-
Iterated local search algorithms for the Euclidean Steiner tree problem in "n" dimensions
Forte, Vinícius Leal do, (2016)
-
Mathematical models for optimizing production chain planning in salmon farming
Bravo, Fernanda, (2013)
- More ...