Connected graph partitioning with aggregated and non‐aggregated gap objective functions

DOI10.1002/net.22181OpenAlexW4385740450MaRDI QIDQ6180037

Isabella Lari, Federica Ricca, Elena Fernández, Justo Puerto, Andrea Scozzari

Publication date: 18 January 2024

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22181

zbMATH Keywords

integer programming formulationsbalance criteriaaggregated gap objective functionsconnected graph partitioningflow-based connectivity constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
• Partitioning a graph into minimum gap components
• A shifting algorithm for constrained min-max partition on trees
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements
• A comparison of formulations and solution methods for the minimum-envy location problem
• On the complexity of partitioning graphs into connected subgraphs
• Some simplified NP-complete graph problems
• Cluster analysis and mathematical programming
• Clustering on trees
• Clustering data that are graph connected
• Uniform and most uniform partitions of trees
• Most uniform path partitioning and its use in image processing
• The shifting algorithm technique for the partitioning of trees
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Mathematical programming formulations for practical political districting
• On finding connected balanced partitions of trees
• Partitioning a graph into balanced connected classes: formulations, separation and experiments
• A branch-and-price procedure for clustering data that are graph connected
• Political districting to minimize cut edges
• Mathematical political districting taking care of minority groups
• Political districting: from classical models to recent approaches
• Categorical data fuzzy clustering: an analysis of local search heuristics
• On the asymmetric representatives formulation for the vertex coloring problem
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• Metaheuristics for the minimum gap graph partitioning problem
• Cardinality constrained connected balanced partitions of trees under different criteria
• Algorithms and complexity of range clustering
• On the Solution of a Graph Partitioning Problem under Capacity Constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Max-Min Tree Partitioning
• A Shifting Algorithm for Min-Max Tree Partitioning
• A Canonical Representation of Simple Plant Location Problems and Its Applications
• Max-min partitioning of grid graphs into connected components
• Fair dissections of spiders, worms, and caterpillars
• Imposing Contiguity Constraints in Political Districting Models
• The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>

This page was built for publication: Connected graph partitioning with aggregated and non‐aggregated gap objective functions