Abstract
The topic of this paper are integer programming models in which a subset of 0/1-variables encode a partitioning of a set of objects into disjoint subsets. Such models can be surprisingly hard to solve by branch-and-cut algorithms if the order of the subsets of the partition is irrelevant. This kind of symmetry unnecessarily blows up the branch-and-cut tree.
We present a general tool, called orbitopal fixing, for enhancing the capabilities of branch-and-cut algorithms in solving such symmetric integer programming models. We devise a linear time algorithm that, applied at each node of the branch-and-cut tree, removes redundant parts of the tree produced by the above mentioned symmetry. The method relies on certain polyhedra, called orbitopes, which have been investigated in [11]. It does, however, not add inequalities to the model, and thus, it does not increase the difficulty of solving the linear programming relaxations. We demonstrate the computational power of orbitopal fixing at the example of a graph partitioning problem motivated from frequency planning in mobile telecommunication networks.
Supported by the DFG Research Center Matheon Mathematics for key technologies in Berlin.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Achterberg, T.: SCIP – A framework to integrate constraint and mixed integer programming. Report 04-19, Zuse Institute Berlin (2004), http://www.zib.de/Publications/abstracts/ZR-04-19/
Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42–54 (2005)
Chopra, S., Rao, M.R.: The partition problem. Math. Program. 59(1), 87–115 (1993)
Chopra, S., Rao, M.R.: Facets of the k-partition polytope. Discrete Appl. Math. 61(1), 27–48 (1995)
Eisenblätter, A.: Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. PhD thesis, TU Berlin (2001)
Falkner, J., Rendl, F., Wolkowicz, H.: A computational study of graph partitioning. Math. Program. 66(2), 211–239 (1994)
Ferreira, C., Martin, A., de Souza, C., Weismantel, R., Wolsey, L.: Formulations and valid inequalities of the node capacitated graph partitioning problem. Math. Program. 74, 247–266 (1996)
Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: The node capacitated graph partitioning problem: A computational study. Math. Program. 81(2), 229–256 (1998)
Grötschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Prog. 45(1), 59–96 (1989)
Grötschel, M., Wakabayashi, Y.: Facets of the clique partitioning polytope. Math. Prog. 47(3), 367–387 (1990)
Kaibel, V., Pfetsch, M.E.: Packing and partitioning orbitopes, Math. Program., In press (2007)
Kochenberger, G., Glover, F., Alidaee, B., Wang, H.: Clustering of microarray data via clique partitioning. J. Comb. Optim. 10(1), 77–92 (2005)
Ostrowski, J.P., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 104–118. Springer, Heidelberg (2007)
Margot, F.: Pruning by isomorphism in branch-and-cut. Math. Program. 94(1), 71–90 (2002)
Margot, F.: Exploiting orbits in symmetric ILP. Math. Program. 98(1–3), 3–21 (2003)
Margot, F.: Small covering designs by branch-and-cut. Math. Program. 94(2–3), 207–220 (2003)
Margot, F.: Symmetric ILP: Coloring and small integers. Discrete Opt. 4(1), 40–62 (2007)
Mehrotra, A., Trick, M.A.: Cliques and clustering: A combinatorial approach. Oper. Res. Lett. 22(1), 1–12 (1998)
Sørensen, M.M.: Polyhedral computations for the simple graph partitioning problem. Working paper L-2005-02, Århus School of Business (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kaibel, V., Peinhardt, M., Pfetsch, M.E. (2007). Orbitopal Fixing. In: Fischetti, M., Williamson, D.P. (eds) Integer Programming and Combinatorial Optimization. IPCO 2007. Lecture Notes in Computer Science, vol 4513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72792-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-72792-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72791-0
Online ISBN: 978-3-540-72792-7
eBook Packages: Computer ScienceComputer Science (R0)