On the maximum small-world subgraph problem
Year of publication: |
2020
|
---|---|
Authors: | Kim, Jongeun ; Veremyev, Alexander ; Boginski, Vladimir ; Prokopyev, Oleg |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 280.2020, 3 (1.2.), p. 818-831
|
Subject: | Clique relaxations | Combinatorial optimization | Integer programming | Network community detection | Networks | Theorie | Theory | Ganzzahlige Optimierung | Mathematik | Mathematics | Mathematische Optimierung | Mathematical programming | Netzwerk | Network | Scheduling-Verfahren | Scheduling problem | Unternehmensnetzwerk | Business network |
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
An analytical comparison of the LP relaxations of integer models for the k-club problem
Almeida, Maria Teresa, (2014)
-
Otsuki, Kensuke, (2016)
- More ...
-
Veremyev, Alexander, (2022)
-
Identifying large robust network clusters via new compact formulations of maximum k-club problems
Veremyev, Alexander, (2012)
-
Minimum vertex cover problem for coupled interdependent networks with cascading failures
Veremyev, Alexander, (2014)
- More ...