IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

A “joint + marginal” heuristic for 0/1 programs

Listed author(s):
  • Jean Lasserre


  • Tung Thanh


Registered author(s):

    We propose a heuristic for 0/1 programs based on the recent “joint + marginal” approach of the first author for parametric polynomial optimization. The idea is to first consider the n-variable (x 1 , . . . , x n ) problem as a (n − 1)-variable problem (x 2 , . . . , x n ) with the variable x 1 being now a parameter taking value in {0, 1}. One then solves a hierarchy of what we call “joint + marginal” semidefinite relaxations whose duals provide a sequence of polynomial approximations $${x_1\mapsto J_k(x_1)}$$ that converges to the optimal value function J (x 1 ) (as a function of the parameter x 1 ). One considers a fixed index k in the hierarchy and if J k (1) > J k (0) then one decides x 1 = 1 and x 1 =0 otherwise. The quality of the approximation depends on how large k can be chosen (in general, for significant size problems, k=1 is the only choice). One iterates the procedure with now a (n − 2)-variable problem with one parameter $${x_2 \in \{0, 1\}}$$ , etc. Variants are also briefly described as well as some preliminary numerical experiments on the MAXCUT, k-cluster and 0/1 knapsack problems. Copyright Springer Science+Business Media, LLC. 2012

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Springer in its journal Journal of Global Optimization.

    Volume (Year): 54 (2012)
    Issue (Month): 4 (December)
    Pages: 729-744

    in new window

    Handle: RePEc:spr:jglopt:v:54:y:2012:i:4:p:729-744
    DOI: 10.1007/s10898-011-9788-9
    Contact details of provider: Web page:

    Order Information: Web:

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:4:p:729-744. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)

    or (Rebekah McClure)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.