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 | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Theorie | Theory | Soziales Netzwerk | Social network | Unternehmensnetzwerk | Business network | Netzwerk | Network | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem |
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
Lateness minimization in pairwise connectivity restoration problems
Averbakh, Igor, (2018)
-
Robust routing in deterministic delay-tolerant networks
Bocquillon, Ronan, (2018)
- More ...
-
Veremyev, Alexander, (2022)
-
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 ...