Exact combinatorial algorithms and experiments for finding maximum k-plexes
Year of publication: |
2012
|
---|---|
Authors: | Moser, Hannes ; Niedermeier, Rolf ; Sorge, Manuel |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 24.2012, 3, p. 347-373
|
Subject: | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | USA | United States | Theorie | Theory | Algorithmus | Algorithm |
-
An ant colony optimisation algorithm for solving the asymmetric traffic assignment problem
D’Acierno, Luca, (2012)
-
Asghari, Mohammad, (2020)
-
An exact algorithm for the block relocation problem with a stowage plan
Tanaka, Shunji, (2019)
- More ...
-
Constant-factor approximations for capacitated arc routing without triangle inequality
Bevern, René van, (2014)
-
A note on clustering aggregation for binary clusterings
Chen, Jiehua, (2024)
-
Separator-based data reduction for signed graph balancing
Hüffner, Falk, (2010)
- More ...