A matheuristic for large-scale capacitated clustering
| Year of publication: |
2021
|
|---|---|
| Authors: | Gnägi, Mario ; Baumann, Philipp |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 132.2021, p. 1-15
|
| Subject: | Binary linear programming | Capacitated -median problem | Capacitated centered clustering problem | Large-scale capacitated clustering | Matheuristic | Regionales Cluster | Regional cluster | Mathematische Optimierung | Mathematical programming | Clusteranalyse | Cluster analysis | Kapazitätsplanung | Capacity planning | Heuristik | Heuristics | Theorie | Theory |
-
Scatter tabu search for multiobjective clustering problems
Caballero, Rafael, (2011)
-
Local search for constrained graph clustering in biological networks
Tran, Duy Hoang, (2021)
-
Solving multiple facilities location problems with separated clusters
Brimberg, Jack, (2019)
- More ...
-
Trautmann, Norbert, (2022)
-
Mixed-integer linear programming for project scheduling under various resource constraints
Klein, Nicklas, (2024)
-
An algorithm for clustering with confidence-based must-link and cannot-link constraints
Baumann, Philipp, (2025)
- More ...