IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v65y2016i1d10.1007_s10589-016-9835-z.html
   My bibliography  Save this article

A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space

Author

Listed:
  • Marcia Fampa

    (Universidade Federal do Rio de Janeiro)

  • Jon Lee

    (University of Michigan)

  • Wendel Melo

    (PESC/COPPE, Universidade Federal do Rio de Janeiro)

Abstract

We present a specialized branch-and-bound (b&b) algorithm for the Euclidean Steiner tree problem (ESTP) in $$\mathbb {R}^n$$ R n and apply it to a convex mixed-integer nonlinear programming (MINLP) formulation of the problem, presented by Fampa and Maculan. The algorithm contains procedures to avoid difficulties observed when applying a b&b algorithm for general MINLP problems to solve the ESTP. Our main emphasis is on isomorphism pruning, in order to prevent solving several equivalent subproblems corresponding to isomorphic Steiner trees. We introduce the concept of representative Steiner trees, which allows the pruning of these subproblems, as well as the implementation of procedures to fix variables and add valid inequalities. We also propose more general procedures to improve the efficiency of the b&b algorithm, which may be extended to the solution of other MINLP problems. Computational results demonstrate substantial gains compared to the standard b&b for convex MINLP.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:coopap:v:65:y:2016:i:1:d:10.1007_s10589-016-9835-z
    DOI: 10.1007/s10589-016-9835-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-016-9835-z
    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/s10589-016-9835-z?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. Omprakash K. Gupta & A. Ravindran, 1985. "Branch and Bound Experiments in Convex Nonlinear Integer Programming," Management Science, INFORMS, vol. 31(12), pages 1533-1546, December.
    2. Wendel Melo & Marcia Fampa & Fernanda Raupp, 2014. "Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming," Journal of Global Optimization, Springer, vol. 60(2), pages 373-389, October.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    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. 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.
    3. 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.

    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. 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.
    2. Terzi, Mourad & Ouazene, Yassine & Yalaoui, Alice & Yalaoui, Farouk, 2023. "Lot-sizing and pricing decisions under attraction demand models and multi-channel environment: New efficient formulations," Operations Research Perspectives, Elsevier, vol. 10(C).
    3. David E. Bernal & Zedong Peng & Jan Kronqvist & Ignacio E. Grossmann, 2022. "Alternative regularizations for Outer-Approximation algorithms for convex MINLP," Journal of Global Optimization, Springer, vol. 84(4), pages 807-842, December.
    4. Wendel Melo & Marcia Fampa & Fernanda Raupp, 2022. "Two linear approximation algorithms for convex mixed integer nonlinear programming," Annals of Operations Research, Springer, vol. 316(2), pages 1471-1491, September.
    5. Kumar Abhishek & Sven Leyffer & Jeff Linderoth, 2010. "FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 555-567, November.
    6. Shyamal Gondkar & Sivakumar Sreeramagiri & Edwin Zondervan, 2012. "Methodology for Assessment and Optimization of Industrial Eco-Systems," Challenges, MDPI, vol. 3(1), pages 1-21, June.
    7. Francisco Trespalacios & Ignacio E. Grossmann, 2016. "Cutting Plane Algorithm for Convex Generalized Disjunctive Programs," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 209-222, May.
    8. Corazza, Marco & Favaretto, Daniela, 2007. "On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1947-1960, February.
    9. Jin, Tongdan & Tian, Yu, 2012. "Optimizing reliability and service parts logistics for a time-varying installed base," European Journal of Operational Research, Elsevier, vol. 218(1), pages 152-162.
    10. Sönke Behrends & Ruth Hübner & Anita Schöbel, 2018. "Norm bounds and underestimators for unconstrained polynomial integer minimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 73-107, February.
    11. Zhou Wei & M. Montaz Ali & Liang Xu & Bo Zeng & Jen-Chih Yao, 2019. "On Solving Nonsmooth Mixed-Integer Nonlinear Programming Problems by Outer Approximation and Generalized Benders Decomposition," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 840-863, June.
    12. Xiaoling Sun & Duan Li, 2000. "Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation," Mathematics of Operations Research, INFORMS, vol. 25(4), pages 625-644, November.
    13. Wendel Melo & Marcia Fampa & Fernanda Raupp, 2018. "Integrality gap minimization heuristics for binary mixed integer nonlinear programming," Journal of Global Optimization, Springer, vol. 71(3), pages 593-612, July.
    14. Qin, Ruwen & Cudney, Elizabeth A. & Hamzic, Zlatan, 2015. "An optimal plan of zero-defect single-sampling by attributes for incoming inspections in assembly lines," European Journal of Operational Research, Elsevier, vol. 246(3), pages 907-915.
    15. Ruiz, Juan P. & Grossmann, Ignacio E., 2012. "A hierarchy of relaxations for nonlinear convex generalized disjunctive programming," European Journal of Operational Research, Elsevier, vol. 218(1), pages 38-47.
    16. Mostafa Parsa & Ali Shahandeh Nookabadi & Zümbül Atan & Yaser Malekian, 2022. "An optimal inventory policy for a multi-echelon closed-loop supply chain of postconsumer recycled content products," Operational Research, Springer, vol. 22(3), pages 1887-1938, July.
    17. Andreas Lundell & Jan Kronqvist, 2022. "Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT," Journal of Global Optimization, Springer, vol. 82(4), pages 863-896, April.
    18. Alexander Murray & Timm Faulwasser & Veit Hagenmeyer & Mario E. Villanueva & Boris Houska, 2021. "Partially distributed outer approximation," Journal of Global Optimization, Springer, vol. 80(3), pages 523-550, July.
    19. Birolini, Sebastian & Jacquillat, Alexandre & Cattaneo, Mattia & Antunes, António Pais, 2021. "Airline Network Planning: Mixed-integer non-convex optimization with demand–supply interactions," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 100-124.
    20. Fukasawa, Ricardo & He, Qie & Song, Yongjia, 2016. "A disjunctive convex programming approach to the pollution-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 61-79.

    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:coopap:v:65:y:2016:i:1:d:10.1007_s10589-016-9835-z. 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.