IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/2023020.html
   My bibliography  Save this paper

Optimizing over Path-Length Matrices of Unrooted Binary Trees

Author

Listed:
  • Catanzaro, Daniele

    (Université catholique de Louvain, LIDAM/CORE, Belgium)

  • Pesenti, Raffaele

    (University Ca’ Foscari)

  • Sapucaia, Allan

    (Université catholique de Louvain, LIDAM/CORE, Belgium)

  • Wolsey, Laurence

    (Université catholique de Louvain, LIDAM/CORE, Belgium)

Abstract

We characterize the set Θn of the path-length matrices induced by unrooted binary trees with n leaves, based in part on a strengthening of results on the tree realization problem. In addition, we present several new valid inequalities and polyhedral results for the convex hull of Θn. We then focus on the Balanced Minimum Evolution Problem (BMEP), a NP-hard nonlinear optimization problem over Θn much studied in the literature on molecular phylogenetics. Working in an extended space, our characterization leads to a first integer linear programming formulation for the BMEP. Modifying this formulation and strengthening the valid inequalities derived earlier by lifting leads to a second formulation which constitutes the core of a branch-and-cut algorithm. Including a new primal heuristic and several separation oracles, this algorithm significantly outperforms the best available exact algorithm for BMEP, based on a dedicated massively parallel branch-and-bound algorithm.

Suggested Citation

  • Catanzaro, Daniele & Pesenti, Raffaele & Sapucaia, Allan & Wolsey, Laurence, 2023. "Optimizing over Path-Length Matrices of Unrooted Binary Trees," LIDAM Discussion Papers CORE 2023020, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:2023020
    as

    Download full text from publisher

    File URL: https://dial.uclouvain.be/pr/boreal/en/object/boreal%3A277008/datastream/PDF_01/view
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2023020. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.