Advertisement

Journal of Combinatorial Optimization

, Volume 12, Issue 3, pp 187–215 | Cite as

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

  • Eranda Çela
  • Bettina Klinz
  • Christophe Meyer
Article

Abstract

In this paper we consider the constant rank unconstrained quadratic 0-1 optimization problem, CR-QP01 for short. This problem consists in minimizing the quadratic function 〈x, Ax〉 + 〈c, x〉 over the set {0,1} n where c is a vector in ℝ n and A is a symmetric real n × n matrix of constant rank r.

We first present a pseudo-polynomial algorithm for solving the problem CR-QP01, which is known to be NP-hard already for r = 1. We then derive two new classes of special cases of the CR-QP01 which can be solved in polynomial time. These classes result from further restrictions on the matrix A. Finally we compare our algorithm with the algorithm of Allemand et al. (2001) for the CR-QP01 with negative semidefinite A and extend the range of applicability of the latter algorithm. It turns out that neither of the two algorithms dominates the other with respect to the class of instances which can be solved in polynomial time.

Keywords

Quadratic 0-1 programming Special case Local minima Constant rank matrix Stable sets 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allemand K, Fukuda K, Liebling TM, Steiner E (2001) A polynomial case of unconstrained zero-one quadratic optimization. Math Program 91(1):49–52zbMATHMathSciNetGoogle Scholar
  2. Barahona F (1986) A solvable case of quadratic 0-1 programming. Discr Appl Math 13(1):23–26zbMATHMathSciNetCrossRefGoogle Scholar
  3. Beineke LW (1997) Biplanar graphs: A survey. Comput Math Appl 34(11):1–8zbMATHMathSciNetCrossRefGoogle Scholar
  4. Berge C (1976) Graphs and hypergraphs, 2nd edn. North-Holland Publishing CompanyGoogle Scholar
  5. Bodlaender HL (1998) A partial k-arboretum of graphs with bounded treewidth. Theor Comput Sci 209:1–45zbMATHMathSciNetCrossRefGoogle Scholar
  6. Boros E, Hammer PL (1991) The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. Ann Oper Res 33(1–4):151–180zbMATHMathSciNetCrossRefGoogle Scholar
  7. Boros E, Elbassioni K, Gurvich V, Khachiyan L (2004) Generating maximal independent sets for hypergraphs with bounded edge-intersections. In Farach-Colton M (ed) LATIN 2004: Theoretical Informatics: 6th Latin American Symposium. Buenos Aires, Argentina. Lecture Notes Comput Sci 2976:488–498Google Scholar
  8. Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Comm ACM 16:575–577zbMATHCrossRefGoogle Scholar
  9. Chiba N, Nishizeki T (1985) Arboricity and subgraph listing algorithms. SIAM J Comput 14:210–223zbMATHMathSciNetCrossRefGoogle Scholar
  10. Crama Y, Hansen P, Jaumard B (1990) The basic algorithm for pseudo-Boolean programming revisited. Discr Appl Math 29(2–3):171–185zbMATHMathSciNetCrossRefGoogle Scholar
  11. Dahlhaus E, Karpinski M (1988) A fast parallel algorithm for computing all maximal cliques in a graph and related problems. In: Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, vol. 318, Springer Verlag, Berlin, Heidelberg, New York, pp 139–144Google Scholar
  12. Edelsbrunner H (1987) Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, vol. 10, Springer Verlag, Berlin, Heidelberg, New YorkGoogle Scholar
  13. Eiter T, Gottlob G (1995) Identifying the minimal transversals of a hypergraph and related problems. SIAM J Comput 24(6):1278–1304zbMATHMathSciNetCrossRefGoogle Scholar
  14. Ferrez J-A, Fukuda K, Liebling TM (2005) Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm. Eur J Oper Res 166(1):35–50zbMATHMathSciNetCrossRefGoogle Scholar
  15. Gantmacher FR (1959) The theory of matrices. AMS Chelsea PublishingGoogle Scholar
  16. Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, San Francisco, CA, 1979Google Scholar
  17. Hammer PL, Hansen P, Pardalos PM, Rader DJ (2002) Maximizing the product of two linear functions in 0-1 variables. Optimization 51:511–537zbMATHMathSciNetCrossRefGoogle Scholar
  18. Johnson DS, Yannakakis M, Papadimitriou CH (1988) On generating all maximal independent sets. Inform Proc Lett 27:119–123zbMATHMathSciNetCrossRefGoogle Scholar
  19. Mulligan GD, Corneil DG (1972) Corrections to Bierstone’s algorithm for generating cliques. J Assoc Comput Mach 19:244–247zbMATHGoogle Scholar
  20. Papadimitriou CH (1981) On the complexity of integer programming. J Assoc Comput Mach 28(4):765–768zbMATHMathSciNetGoogle Scholar
  21. Pardalos PM, Jha S (1991) Graph separation techniques for quadratic zero-one programming. Comput Math Appl 21(6/7):107–113zbMATHMathSciNetCrossRefGoogle Scholar
  22. Picard JC, Ratliff HD (1975) Minimum cuts and related problems. Networks 5(4):357–370zbMATHMathSciNetGoogle Scholar
  23. Tsukiyama S, Ide M, Ariyoshi H, Shirakawa I (1977) A new algorithm for generating all the maximal independent sets. SIAM J Comput 6:505–517zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Institut für Optimierung und Diskrete MathematikTechnische Universität GrazGrazAustria
  2. 2.Département d’Informatique et de Recherche OpérationnelleUniversité de MontréalMontréalCanada

Personalised recommendations