Abstract
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 node weight constraints, and the total cost of the edges whose end nodes are in the same cluster is minimized. It arises as a sub-problem of an integrated vehicle and pollster problem from a real-world application. Two integer programming formulations are provided, and several families of valid inequalities associated with the respective polyhedra are proved. An exact algorithm based on Branch & Bound and cutting planes is proposed, and it is tested on real-world instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aardal K, Bixby RE, Hurkens CAJ, Lenstra AK, Smeltink JW (1999) Market split and basis reduction: towards a solution of the cornuéjols-dawande instances. In: Integer programming and combinatorial optimization. Springer, Berlin, pp 1–16
Alizadeh F (1995) Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J Optim 5(1):13–51
Aykanat C, Barla Cambazoglu B, Uçar B (2008) Multi-level direct k-way hypergraph partitioning with multiple constraints and fixed vertices. J Parall Distribut Comput 68(5):609–625
Buluç A, Meyerhenke H, Safro I, Sanders P, Schulz C (2016) Recent advances in graph partitioning. In: Kliemann L, Sanders P (eds) Algorithm engineering: selected results and surveys. Springer International Publishing, Cham, pp 117–158
Carlson RC, Nemhauser GL (1966) Scheduling to minimize interaction cost. Oper Res 14(1):52–58
Chopra S, Rao MR (1993) The partition problem. Math Program 59(1–3):87–115
Christofides N, Brooker P (1976) The optimal partitioning of graphs. SIAM J Appl Math 30(1):55–69
Delling D, Fleischman D, Goldberg AV, Razenshteyn I, Werneck RF (2014) An exact combinatorial algorithm for minimum graph bisection. Math Program 153(2):417–458
Fairbrother J, Letchford AN, Briggs K (2017) A two-level graph partitioning problem arising in mobile wireless communications. Comput Optim Appl 69(3):653–676
Fan N, Pardalos PM (2010) Linear and quadratic programming approaches for the general graph partitioning problem. J Global Optim 48(1):57–71
Ferreira C, Martin A, de Souza C, Weismantel R, Wolsey L (1998) The node capacitated graph partitioning problem: a computational study. Math Program 81:229–256
Fiedler M (1975) A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslov Math J 25(4):619–633
Garey MR, Johnson DS, Stockmeyer L (1976) Some simplified NP-complete graph problems. Theoret Comput Sci 1(3):237–267
Grötschel M, Wakabayashi Y (1989) A cutting plane algorithm for a clustering problem. Math Program 45:59–96
Gutierrez S, Miniguano A, Recalde D, Torres LM, Torres R, Zuleta P (2019) Integrated vehicle and pollster routing. Technical report, Escuela Politécnica Nacional, Department of Mathematics, 07
Hager WW, Phan DT, Zhang H (2011) An exact algorithm for graph partitioning. Math Program 137(1–2):531–556
Hendrickson B, Kolda TG (2000) Graph partitioning models for parallel computing. Parallel Comput 26(12):1519–1534
Hendrickson B, Leland R (1995) A multilevel algorithm for partitioning graphs. In: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM)–Supercomputing 95. ACM Press
Inc. Gurobi Optimization (2018) Gurobi optimizer reference manual
Kahng A, Lienig J, Markov I, Hu J (2011) VLSI physical design: from graph partitioning to timing closure, 1st edn. Springer Publishing Company, Incorporated, Berlin
Kaibel V, Peinhardt M, Pfetsch ME (2011) Orbitopal fixing. Discret Optim 8(4):595–610
Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359–392
Karypis G, Kumar V (1998) Multilevel algorithms for multi-constraint graph partitioning. In: Proceedings of the IEEE/ACM SC98 conference. IEEE
Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291–307
Labbé M, Özsoy FA (2010) Size-constrained graph partitioning polytopes. Discret Math 310:3473–3493
Margot F (2009) Symmetry in integer linear programming. In: 50 years of integer programming 1958–2008. Springer, Berlin, pp 647–686
Meila M (2016) Spectral clustering: a tutorial for the 2010’ s. 2016
Mitchell JE (2001) Branch-and-cut for the k-way equipartition problem. Technical report, Department of Mathematical Sciences, Rensselaer Polytechnic Institute
Mitchell JE (2003) Realignment in the national football league: Did they do it right? Naval Res Log 50(7):683–701
Ostrowski J, Linderoth J, Rossi F, Smriglio S (2009) Orbital branching. Math Program 126(1):147–178
Recalde D, Severín D, Torres R, Vaca P (2018) An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment. J Combin Optim 36(3):916–936
Rendl F (2012) Semidefinite relaxations for partitioning, assignment and ordering problems. 4OR 10(4):321–346
Rodrigues de Sousa VJ, Anjos MF, Le Digabel S (2017) Computational study of valid inequalities for the maximum k-cut problem. Ann Oper Res 265(1):5–27
Sanders P, Schulz C (2012) Distributed evolutionary graph partitioning. In: 2012 Proceedings of the fourteenth workshop on algorithm engineering and experiments (ALENEX), Society for Industrial and Applied Mathematics, pp 16–29
Schloegel K, Karypis G, Kumar V (2002) Parallel static and dynamic multi-constraint graph partitioning. Concurr Comput Pract Exp 14(3):219–240
Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905
Slota GM, Madduri K, Rajamanickam S (2014) Pulp: Scalable multi-objective multi-constraint partitioning for small-world networks. 2014 IEEE International Conference on Big Data (Big Data), pp 481–490
Sotirov R (2014) An efficient semidefinite programming relaxation for the graph partition problem. INFORMS J Comput 26(1):16–30
Spielman DA, Teng S-H (2007) Spectral partitioning works: Planar graphs and finite element meshes. Linear Algebra Appl 421(2–3):284–305
Tanaka M, Tatebe O (2012) Workflow scheduling to minimize data movement using multi-constraint graph partitioning. In: 2012 12th IEEE/ACM international symposium on cluster, cloud and grid computing (ccgrid 2012), pp 65–72
Uçar B, Aykanat C (2007) Partitioning sparse matrices for parallel preconditioned iterative methods. SIAM J Sci Comput 29(4):1683–1709
Wolkowicz H, Zhao Q (1999) Semidefinite programming relaxations for the graph partitioning problem. Discret. Appl. Math. 96–97:461–479
Zhan Q, Zhu W, He X (2010) A grasp based algorithm for multi-constraint circuit partitioning. In: 2010 sixth international conference on natural computation, vol 6, pp 3110–3114
Acknowledgements
This research was funded by Escuela Politécnica Nacional (project PII-DM-01-2018). Moreover, we are grateful to the anonymous referees for their useful comments which led to a significantly improved presentation of this work.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Recalde, D., Torres, R. & Vaca, P. An exact approach for the multi-constraint graph partitioning problem. EURO J Comput Optim 8, 289–308 (2020). https://doi.org/10.1007/s13675-020-00126-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13675-020-00126-9