Abstract
We study a variant of the graph partitioning problem where the weight of a cluster in the partition depends on the edges incident to its nodes. This problem was first proposed in the context of optical networks design. We recall complexity results and establish new inaproximability results. We then study several mixed integer quadratic programming formulations for the problem and different solutions techniques. We present experimental results comparing the various formulations and solution techniques.
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
Preview
Unable to display preview. Download preview PDF.
References
Andreev, K., Racke, H.: Balanced graph partitioning. Theor. Comp. Sys. 39, 929–939 (2006)
Balas, E.: Projection and Lifting in Combinatorial Optimization. In: Jünger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. LNCS, vol. 2241, pp. 26–56. Springer, Heidelberg (2001)
Ben-Ameur, W., Neto, J.: Acceleration of cutting-plane and column generation algorithms: Applications to network design. Networks 49(1), 3–17 (2007)
Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem. Mathematical Programming 109, 55–68 (2007)
Fischetti, M., Salvagnin, D.: An In-Out Approach to Disjunctive Optimization. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 136–140. Springer, Heidelberg (2010)
Gabrel, V., Minoux, M.: LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions. Acta Mathematica Vietnamica 22, 123–145 (1997)
Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Co., San Francisco (1979)
Goldschmidt, O., Laugier, A., Olinick, E.V.: Sonet/sdh ring assignment with capacity constraints. Discrete Appl. Math. 129, 99–128 (2003)
Grötschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45(1), 59–96 (1989)
Hyafil, L., Rivest, R.: Graph partitioning and constructing optimal deiscion trees are polynomial complete problems. Tech. Rep. 33, INRIA Laboria (1973)
Macambira, E.M., Maculan, N., de Souza, C.C.: A column generation approach for sonet ring assignment. Networks 47(3), 157–171 (2006)
Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Mathematical Programming 130, 359–413 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonami, P., Nguyen, V.H., Klein, M., Minoux, M. (2012). On the Solution of a Graph Partitioning Problem under Capacity Constraints. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-32147-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32146-7
Online ISBN: 978-3-642-32147-4
eBook Packages: Computer ScienceComputer Science (R0)