Skip to main content
SpringerLink
Log in

Quadratic convex reformulations for quadratic 0–1 programming

  • PhD Thesis
  • Published:
4OR Aims and scope Submit manuscript

Abstract

This is a summary of the author’s PhD thesis supervised by A. Billionnet and S. Elloumi and defended on November 2006 at the CNAM, Paris (Conservatoire National des Arts et Métiers). The thesis is written in French and is available from http://www.cedric.cnam.fr/PUBLIS/RC1115. This work deals with exact solution methods based on reformulations for quadratic 0–1 programs under linear constraints. These problems are generally not convex; more precisely, the associated continuous relaxation is not a convex problem. We developed approaches with the aim of making the initial problem convex and of obtaining a good lower bound by continuous relaxation. The main contribution is a general method (called QCR) that we implemented and applied to classical combinatorial optimization problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Billionnet A (2005) Optimisation combinatoire, concepts fondamentaux. chapt. 7, Lavoisier, pp 191–236

  • Billionnet A, Elloumi S, Plateau M-C (2006) Quadratic 0–1 programming: tightening linear or quadratic convex reformulation by use of relaxations. RAIRO/Operations Res (forthcoming)

  • Boros E, Hammer PL (2002) Pseudo-boolean optimization. Discrete Appl Math 123:115–225

    Article  Google Scholar 

  • Hansen P, Jaumard B, Mathon V (1993) Constrained nonlinear 0–1 programming. ORSA J Comput 5:97–119

    Google Scholar 

  • Karisch SE, Rendl F, Clausen J (2000) Solving graph bisection problems with semidefinite programming. INFORMS J Comput 13(3):177–191

    Article  Google Scholar 

  • Plateau M-C, Billionnet A, Elloumi S (2005) Eigenvalue methods for linearly constrained quadratic 0–1 problems with application to the densest k-subgraph problem. In: 6ème congrès ROADEF, Tours, 14–16 février, Presses Universitaires Francois Rabelais, pp 55–66

  • Sherali HD, Adams WP (1999) A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer, Norwell

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire CEDRIC, Conservatoire National des Arts et Métiers, 292 rue Saint-Martin, 75141, Paris, France

    Marie-Christine Plateau

Authors
  1. Marie-Christine Plateau
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marie-Christine Plateau.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Plateau, MC. Quadratic convex reformulations for quadratic 0–1 programming. 4OR 6, 187–190 (2008). https://doi.org/10.1007/s10288-007-0044-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-007-0044-6

Keywords

MSC Classification (2000)

Search

Navigation