An exact approach for the multi-constraint graph partitioning problem

In this work, a multi-constraint graph partitioning problem is introduced. The input is an undirected graph with costs on the edges and multiple weights on the nodes. The problem calls for a partition of the node set into a fixed number of clusters, such that each cluster satisfies a collection of n...

Full description

Saved in:
Bibliographic Details
Main Authors: Diego Recalde, Ramiro Torres, Polo Vaca
Format: article
Language:EN
Published: Elsevier 2020
Subjects:
Online Access:https://doaj.org/article/5d5107523e8947faa2d68e575fb9853f
Tags: Add Tag
No Tags, Be the first to tag this record!