Connected graph partitioning with aggregated and non‐aggregated gap objective functions
Abstract
No abstract availableKeywords
Funding Information
- Sapienza Università di Roma (C26V16M9NH, C26V20SPJ5)
- Ministry for Universities and Research (prot. P2022NK39A)
This publication has 45 references indexed in Scilit:
- A comparison of formulations and solution methods for the minimum-envy location problemComputers & Operations Research, 2009
- Districting Modeling with Exact Contiguity ConstraintsEnvironment and Planning B: Planning and Design, 2009
- On the asymmetric representatives formulation for the vertex coloring problemDiscrete Applied Mathematics, 2008
- A Model of Contiguity for Spatial Unit AllocationGeographical Analysis, 2004
- The shifting algorithm technique for the partitioning of treesDiscrete Applied Mathematics, 1995
- Fair dissections of spiders, worms, and caterpillarsNetworks, 1990
- A Shifting Algorithm for Min-Max Tree PartitioningJournal of the ACM, 1982
- Max-Min Tree PartitioningJournal of the ACM, 1981
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960