Finding maximum subgraphs with relatively large vertex connectivity
Year of publication: |
2014
|
---|---|
Authors: | Veremyev, Alexander ; Prokopyev, Oleg A. ; Boginski, Vladimir ; Pasiliao, Eduardo L. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 239.2014, 2 (1.12.), p. 349-362
|
Subject: | Vertex connectivity | Clique relaxations | Computational complexity | Mixed integer programming | 2-Club | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Theorie | Theory |
-
Finding maximum subgraphs with relatively large vertex connectivity
Veremyev, Alexander, (2014)
-
An analytical comparison of the LP relaxations of integer models for the k-club problem
Almeida, Maria Teresa, (2014)
-
On the maximum small-world subgraph problem
Kim, Jongeun, (2020)
- More ...
-
Finding maximum subgraphs with relatively large vertex connectivity
Veremyev, Alexander, (2014)
-
Veremyev, Alexander, (2022)
-
Minimum vertex cover problem for coupled interdependent networks with cascading failures
Veremyev, Alexander, (2014)
- More ...