1. Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty;Albornoz;Ann. Oper. Res.,2020
2. Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs;Apollonio;Networks,2008
3. Partitioning a graph into minimum gap components;Bruglieri;Electron. Notes Discrete Math.,2016
4. M. Bruglieri, R. Cordone, V. Caurio, A metaheuristic for the minimum gap Graph Partitioning Problem, in: Proceedings of the 15th Cologne-Twente Workshop (CTW2017) on Graphs and Combinatorial Optimization, Cologne, Germany, June 6–8 2017, pp. 23–26.
5. M. Bruglieri, R. Cordone, I. Lari, F. Ricca, A. Scozzari, Some polynomial special cases for the Minimum Gap Graph Partitioning Problem, in: Proceedings of the 16th Cologne-Twente Workshop (CTW2018) on Graphs and Combinatorial Optimization, Paris, France, June 18–20 2018, pp. 107–110.