A branch-and-price framework for decomposing graphs into relaxed cliques
Year of publication: |
2021
|
---|---|
Authors: | Gschwind, Timo ; Irnich, Stefan ; Furini, Fabio |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 3, p. 1070-1090
|
Subject: | graph decomposition | clique relaxations | branch-and-price algorithm | social networks | Graphentheorie | Graph theory | Soziales Netzwerk | Social network | Dekompositionsverfahren | Decomposition method | Mathematische Optimierung | Mathematical programming |
-
Benders decomposition for competitive influence maximization in (social) networks
Kahr, Michael, (2021)
-
Fabio, Furini, (2022)
-
On the 2-club polytope of graphs
Mahdavi Pajouh, Foad, (2016)
- More ...
-
Dual Inequalities for Stabilized Column Generation Revisited
Gschwind, Timo, (2014)
-
Stabilized Column Generation for the Temporal Knapsack Problem using Dual- Optimal Inequalities
Gschwind, Timo, (2014)
-
A note on symmetry reduction for circular traveling tournament problems
Gschwind, Timo, (2011)
- More ...