Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
Year of publication: |
2014
|
---|---|
Authors: | Gendron, Bernard ; Lucena, Abílio ; Cunha, Alexandre Salles da ; Simonetti, Luidi |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 26.2014, 4, p. 645-657
|
Subject: | connected dominating sets | valid inequalities | Benders decomposition | branch and cut | Dekompositionsverfahren | Decomposition method | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Naderi, Bahman, (2019)
-
Solving the type-2 assembly line balancing with setups using logic-based benders decomposition
Zohali, Hassan, (2022)
-
Yin, Jiateng, (2022)
- More ...
-
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)
-
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Lucena, Abílio, (2010)
- More ...