Abstract
This paper addresses the problem of partitioning the vertex set of a given directed, edge- and vertex-weighted graph into disjoint subsets (i.e., clusters). Clusters are to be determined such that the sum of the vertex weights within the clusters satisfies an upper bound and the sum of the edge weights within the clusters is maximized. Additionally, the digraph is enforced to partition into a directed, acyclic graph, i.e., a digraph that contains no directed cycle. This problem is known in the literature as acyclic partitioning problem and is proven to be NP-hard in the strong sense. Real-life applications arise, e.g., at rail-rail transshipment yards and in Very Large Scale Integration (VLSI) design. We propose two model formulations for the acyclic partitioning problem, a compact and an augmented set partitioning model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cong, J., Li, Z., & Bagrodia, R. (1994). Acyclic multi-way partitioning of Boolean networks. In Proceedings of the 31st Annual Design Automation Conference (pp. 670–675). New York: ACM.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability—a guide to the theory of NP-Completeness. New York: Freeman.
Grötschel, M., & Wakabayashi, Y. (1989). A cutting plane algorithm for a clustering problem. Mathematical Programming, 45, 59–96.
Hadlock, F. O. (1974). Minimum spanning forests of bounded trees. In Proceedings of the 5th Southeastern Conference on Combinatorics, Graph Theory, and Computing, (pp. 449–460). Winnipeg: Utilitas Mathematica Publishing.
Lukes, J. A. (1974). Efficient algorithm for the partitioning of trees. IBM Journal of Research and Development, 18, 217–224.
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM, 7, 326–329.
Nossack, J., & Pesch, E. (2014). A branch-and-bound algorithm for the acyclic partitioning problem. Computers & Operations Research, 41, 174–184.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Nossack, J., Pesch, E. (2014). Mathematical Formulations for the Acyclic Partitioning Problem. In: Huisman, D., Louwerse, I., Wagelmans, A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_45
Download citation
DOI: https://doi.org/10.1007/978-3-319-07001-8_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07000-1
Online ISBN: 978-3-319-07001-8
eBook Packages: Business and EconomicsBusiness and Management (R0)