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 . 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.
KeywordsLinear Time Algorithm Integer Programming Model Linear Description Frequency Assignment Problem Clique Inequality
Unable to display preview. Download preview PDF.
- 1.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/
- 5.Eisenblätter, A.: Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. PhD thesis, TU Berlin (2001)Google Scholar
- 7.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)Google Scholar
- 11.Kaibel, V., Pfetsch, M.E.: Packing and partitioning orbitopes, Math. Program., In press (2007)Google Scholar
- 19.Sørensen, M.M.: Polyhedral computations for the simple graph partitioning problem. Working paper L-2005-02, Århus School of Business (2005)Google Scholar