Integer programming formulations and benders decomposition for the maximum induced matching problem
| Year of publication: |
2018
|
|---|---|
| Authors: | Ahat, Betül ; Ekim, Tınaz ; Taşkın, Z. Caner |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 30.2018, 1, p. 43-56
|
| Subject: | integer programming | Benders decomposition | maximum induced matching | distance-2 matching | strong matching | Matching | Dekompositionsverfahren | Decomposition method | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Sun, Peter, (2014)
-
Liu, Guo-Sheng, (2017)
-
Optimal train dispatching by Benders'-like reformulation
Lamorgese, Leonardo, (2016)
- More ...
-
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
Şeker, Oylum, (2021)
-
On some applications of the selective graph coloring problem
Demange, Marc, (2015)
-
On some applications of the selective graph coloring problem
Demange, Marc, (2015)
- More ...