On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
Year of publication: |
2022
|
---|---|
Authors: | Veremyev, Alexander ; Boginski, Vladimir ; Pasiliao, Eduardo L. ; Prokopyev, Oleg |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 297.2022, 1 (16.2.), p. 86-101
|
Subject: | Networks | Graph theory | 2-Clubs | Integer programming | Clique relaxations | Graphentheorie | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming |
-
Finding maximum subgraphs with relatively large vertex connectivity
Veremyev, Alexander, (2014)
-
MIP formulations for induced graph optimization problems : a tutorial
Melo, Rafael A., (2023)
-
On the maximum small-world subgraph problem
Kim, Jongeun, (2020)
- More ...
-
Minimum vertex cover problem for coupled interdependent networks with cascading failures
Veremyev, Alexander, (2014)
-
Finding maximum subgraphs with relatively large vertex connectivity
Veremyev, Alexander, (2014)
-
Minimum vertex cover problem for coupled interdependent networks with cascading failures
Veremyev, Alexander, (2014)
- More ...