IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v83y2022i1d10.1007_s10898-021-01001-6.html
   My bibliography  Save this article

Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in $$\mathbb {R}^d$$ R d

Author

Listed:
  • Hacene Ouzia

    (Sorbonne Universite, CNRS, LIP-6)

  • Nelson Maculan

    (Universidade Federal do Rio de Janeiro, COPPE & IM)

Abstract

New mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in d-space (with $$d\ge 3$$ d ≥ 3 ) will be presented in this work. All models feature a nonsmooth objective function but the continuous relaxations of their set of feasible solutions are convex. From these models, four convex mixed integer linear and nonlinear relaxations will be considered. Each relaxation has the same set of feasible solutions as the set of feasible solutions of the model from which it is derived. Finally, preliminary computational results highlighting the main features of the presented relaxations will be discussed.

Suggested Citation

  • Hacene Ouzia & Nelson Maculan, 2022. "Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in $$\mathbb {R}^d$$ R d," Journal of Global Optimization, Springer, vol. 83(1), pages 119-136, May.
    • Handle: RePEc:spr:jglopt:v:83:y:2022:i:1:d:10.1007_s10898-021-01001-6
    DOI: 10.1007/s10898-021-01001-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-01001-6
    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/s10898-021-01001-6?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.

    References listed on IDEAS

    as
    1. Courtney Stanton & J. MacGregor Smith, 2004. "Steiner Trees and 3-D Macromolecular Conformation," INFORMS Journal on Computing, INFORMS, vol. 16(4), pages 470-485, November.
    2. Nelson Maculan & Philippe Michelon & Adilson Xavier, 2000. "The Euclidean Steiner tree problem in R n : A mathematical programming formulation," Annals of Operations Research, Springer, vol. 96(1), pages 209-220, November.
    3. Marcia Fampa & Jon Lee & Wendel Melo, 2016. "A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space," Computational Optimization and Applications, Springer, vol. 65(1), pages 47-71, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Renan Vicente Pinto & Nelson Maculan, 2023. "A new heuristic for the Euclidean Steiner Tree Problem in $${\mathbb {R}}^n$$ R n," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 391-413, July.
    2. Marcia Fampa & Jon Lee & Wendel Melo, 2016. "A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space," Computational Optimization and Applications, Springer, vol. 65(1), pages 47-71, September.
    3. Wendel Melo & Marcia Fampa & Fernanda Raupp, 2020. "An overview of MINLP algorithms and their implementation in Muriqui Optimizer," Annals of Operations Research, Springer, vol. 286(1), pages 217-241, March.

    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:jglopt:v:83:y:2022:i:1:d:10.1007_s10898-021-01001-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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.