The Semidefinite Relaxation of the k-Partition Polytope Is Strong
Radio frequency bandwidth has become a very scarce resource. This holds true in particular for the popular mobile communication system GSM. Carefully planning the use of the available frequencies is thus of great importance to GSM network operators. Heuristic optimization methods for this task are known, which produce frequency plans causing only moderate amounts of disturbing interference in many typical situations. In order to thoroughly assess the quality of the plans, however, lower bounds on the unavoidable interference are in demand. The results obtained so far using linear programming and graph theoretic arguments do not suffice. By far the best lower bounds are currently obtained from semidefinite programming. The link between semidefinite programming and the bound on unavoidable interference in frequency planning is the semidefinite relaxation of the graph minimum k-partition problem.
Here, we take first steps to explain the surprising strength of the semidefinite relaxation. This bases on a study of the solution set of the semidefinite relaxation in relation to the circumscribed k-partition polytope. Our focus is on the huge class of hypermetric inequalities, which are valid and in many cases facet-defining for the k-partition polytope. We show that a “slightly shifted version” of the hypermetric inequalities is implicit to the semidefinite relaxation. In particular, no feasible point for the semidefinite relaxation violates any of the facet-defining triangle inequalities for the k-partition polytope by more than √2 - 1 or any of the (exponentially many) facet-defining clique constraints by1/2 or more.
KeywordsValid Inequality Dual Solution Frequency Assignment Frequency Planning Integer Linear Programming Formulation
Unable to display preview. Download preview PDF.
- 2.Aardal, K. I., Hoesel, C. P. M. v., Koster, A. M. C. A., Mannino, C., Sassano, A. Models and solution techniques for the frequency assignment problem. ZIB Rep. 01-40, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin, Germany (2001). Available at http://www.zib.de/PaperWeb/abstracts/ZR-01-40/.Google Scholar
- 4.Burer, S., Monteiro, R. D., Zhang, Y. Interior-point algorithms for semidefinite programming based on a nonlinear programming formulation. Tech. Rep. TR 99-27, Department of Computational and Applied Mathematics, Rice University (1999).Google Scholar
- 7.Correia, L. M. (ed.). COST259: Wireless Flexible Personalized Communications. J. Wiley & Sons (2001).Google Scholar
- 8.Deza, M. M., Grötschel, M., Laurent, M. Complete Descriptions of Small Multicut Polytopes. Applied Geometry and Discrete Mathematics—The Victor Klee Festschrift, 4:221–252 (1991).Google Scholar
- 11.Deza, M. M., Laurent, M. Geometry of Cuts and Metrics, vol. 15 of Algorithms and Combinatorics. Springer-Verlag (1997).Google Scholar
- 12.Eisenblätter, A. Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. Ph.D. thesis, TU Berlin, Germany (2001). Cuvillier-Verlag, ISBN 3-8987-3213-4, also available at ftp://ftp.zib.de/pub/zib-publications/books/PhD_eisenblaetter.ps.Z.Google Scholar
- 13.Erdős, P., Rubin, A. L., Taylor, H. Choosability in graphs. Congr. Numer., 26:125–157 (1979).Google Scholar
- 14.Eisenblätter, A., Koster, A. FAP web—a website about frequency assignment problems (2000). URL http://fap.zib.de/.
- 18.Grötschel, M., Lovász, L., Schrijver, A. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 2nd ed. (1994).Google Scholar
- 21.Helmberg, C. Semidefinite programming for combinatorial optimization. Habilitationsschrift, TU Berlin, Berlin, Germany (2000).Google Scholar
- 22.Hurkens, C., Tiourine, S. Upper and lower bounding techniques for frequency assignment problems. Tech. Rep., Eindhoven University of Technology, The Netherlands (1995).Google Scholar
- 23.Jaumard, B., Marcotte, O., Meyer, C. Mathematical models and exact methods for channel assignment in cellular networks. In Sansò, B., Soriano, P. (eds.), Telecommunications Network Planning, chap. 13, pp. 239–255. Kluwer Academic Publishers (1999).Google Scholar
- 25.Koster, A. M. C. A. Frequency Assignment-Models and Algorithms. Ph.D. thesis, Universiteit Maastricht, Maastricht, The Netherlands (1999).Google Scholar
- 28.Poljak, S., Tuza, Z. Maximum cuts and large bipartite subgraphs. In Cook, W., Lovász, L., Seymour, P. (eds.), Combinatorial Optimization, vol. 20 of DIMACS Ser. in Discr Math. and Theoretical Comput. Sci., pp. 188–244. American Mathematical Society (1995).Google Scholar
- 29.Rutten, J. Polyhedral Clustering. Ph.D. thesis, Universiteit Maastricht, Maastricht, The Netherlands (1998).Google Scholar
- 30.Schrijver, A. Theory of Linear and Integer Programming. J. Wiley & Sons (1986).Google Scholar
- 31.Verfaillie, G., Lemaître, M., Schiex, T. Russian doll search for solving constraint optimization problems. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pp. 181–187. Portland, OR, USA (1996).Google Scholar
- 32.West, D. B. Introduction to Graph Theory. Prentice Hall (1996).Google Scholar
- 33.Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.). Handbook on Semidefinite Programming, vol. 27. Kluwer Academic Publishers (2000).Google Scholar