IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i2d10.1007_s10878-015-9970-y.html
   My bibliography  Save this article

Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement

Author

Listed:
  • J. M. G. Salmerón

    (University of Almería (ceiA3))

  • G. Aparicio

    (University of Almería (ceiA3))

  • L. G. Casado

    (University of Almería (ceiA3))

  • I. García

    (Universidad de Málaga)

  • E. M. T. Hendrix

    (Universidad de Málaga
    University of Wageningen)

  • B. G.-Tóth

    (Budapest University of Technology and Economics)

Abstract

In several areas like global optimization using branch-and-bound methods for mixture design, the unit n-simplex is refined by longest edge bisection (LEB). This process provides a binary search tree. For $$n>2$$ n > 2 , simplices appearing during the refinement process can have more than one longest edge (LE). The size of the resulting binary tree depends on the specific sequence of bisected longest edges. The questions are how to calculate the size of one of the smallest binary trees generated by LEB and how to find the corresponding sequence of LEs to bisect, which can be represented by a set of LE indices. Algorithms answering these questions are presented here. We focus on sets of LE indices that are repeated at a level of the binary tree. A set of LEs was presented in Aparicio et al. (Informatica 26(1):17–32, 2015), for $$n=3$$ n = 3 . An additional question is whether this set is the best one under the so-called $$m_k$$ m k -valid condition.

Suggested Citation

  • J. M. G. Salmerón & G. Aparicio & L. G. Casado & I. García & E. M. T. Hendrix & B. G.-Tóth, 2017. "Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 389-402, February.
    • Handle: RePEc:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9970-y
    DOI: 10.1007/s10878-015-9970-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9970-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9970-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9970-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.