A matheuristic for large-scale capacitated clustering

Clustering addresses the problem of assigning similar objects to groups. Since the size of the clusters is often constrained in practical clustering applications, various capacitated clustering problems have received increasing attention. We consider here the capacitated p-median problem (CPMP) in w...

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & operations research Ročník 132; s. 105304
Hlavní autoři:	Gnägi, Mario, Baumann, Philipp
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.08.2021 Pergamon Press Inc
Témata:	Binary linear programming Capacitated centered clustering problem Capacitated p-median problem Clustering Large-scale capacitated clustering Matheuristic Operations research Weight Large-scale capacitated clustering Capacitated centered clustering problem Matheuristic Capacitated p-median problem Binary linear programming
ISSN:	0305-0548, 0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!