IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v56y2013i3p1029-1043.html
   My bibliography  Save this article

A global optimization algorithm for solving the minimum multiple ratio spanning tree problem

Author

Listed:
  • Oleksii Ursulenko
  • Sergiy Butenko
  • Oleg Prokopyev

Abstract

This paper studies the sum-of-ratios version of the classical minimum spanning tree problem. We describe a branch-and-bound algorithm for solving the general version of the problem based on its image space representation. The suggested approach specifically addresses the difficulties arising in the case when the number of ratios exceeds two. The efficacy of our approach is demonstrated on randomly generated complete and sparse graph instances. Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • Oleksii Ursulenko & Sergiy Butenko & Oleg Prokopyev, 2013. "A global optimization algorithm for solving the minimum multiple ratio spanning tree problem," Journal of Global Optimization, Springer, vol. 56(3), pages 1029-1043, July.
    • Handle: RePEc:spr:jglopt:v:56:y:2013:i:3:p:1029-1043
    DOI: 10.1007/s10898-011-9832-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-011-9832-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-011-9832-9?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. Siegfried Schaible, 1976. "Fractional Programming. I, Duality," Management Science, INFORMS, vol. 22(8), pages 858-867, April.
    2. Gabriel R. Bitran & Thomas L. Magnanti, 1976. "Duality and Sensitivity Analysis for Fractional Programs," Operations Research, INFORMS, vol. 24(4), pages 675-699, August.
    3. Nimrod Megiddo, 1979. "Combinatorial Optimization with Rational Objective Functions," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 414-424, November.
    4. Siegfried Schaible, 1976. "Duality in Fractional Programming: A Unified Approach," Operations Research, INFORMS, vol. 24(3), pages 452-461, June.
    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. Shaoning Han & Andrés Gómez & Oleg A. Prokopyev, 2022. "Fractional 0–1 programming and submodularity," Journal of Global Optimization, Springer, vol. 84(1), pages 77-93, September.
    2. Hongtan Sun & Thomas C. Sharkey, 2017. "Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems," Journal of Global Optimization, Springer, vol. 68(3), pages 623-640, July.
    3. Li, Yifu & Qi, Xiangtong, 2022. "A geometric branch-and-bound algorithm for the service bundle design problem," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1044-1056.
    4. Samyukta Sethuraman & Sergiy Butenko, 2015. "The maximum ratio clique problem," Computational Management Science, Springer, vol. 12(1), pages 197-218, January.
    5. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.

    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. Yong Xia & Longfei Wang & Xiaohui Wang, 2020. "Globally minimizing the sum of a convex–concave fraction and a convex function based on wave-curve bounds," Journal of Global Optimization, Springer, vol. 77(2), pages 301-318, June.
    2. Xiaojun Lei & Zhian Liang, 2008. "Study on the Duality between MFP and ACP," Modern Applied Science, Canadian Center of Science and Education, vol. 2(6), pages 1-81, November.
    3. C. Singh & M.A. Hanson, 1991. "Multiobjective fractional programming duality theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(6), pages 925-933, December.
    4. Danny Z. Chen & Ovidiu Daescu & Yang Dai & Naoki Katoh & Xiaodong Wu & Jinhui Xu, 2005. "Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 69-90, February.
    5. Frauke Liers & Lars Schewe & Johannes Thürauf, 2022. "Radius of Robust Feasibility for Mixed-Integer Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 243-261, January.
    6. T Peña & P Lara & C Castrodeza, 2009. "Multiobjective stochastic programming for feed formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1738-1748, December.
    7. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
    8. Denoyel, Victoire & Alfandari, Laurent & Thiele, Aurélie, 2017. "Optimizing healthcare network design under reference pricing and parameter uncertainty," European Journal of Operational Research, Elsevier, vol. 263(3), pages 996-1006.
    9. Paula Alexandra Amaral & Immanuel M. Bomze, 2019. "Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations," Journal of Global Optimization, Springer, vol. 75(2), pages 227-245, October.
    10. Steffen Rebennack & Ashwin Arulselvan & Lily Elefteriadou & Panos M. Pardalos, 2010. "Complexity analysis for maximum flow problems with arc reversals," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 200-216, February.
    11. Bart Smeulders & Laurens Cherchye & Bram De Rock & Frits C. R. Spieksma, 2013. "The Money Pump as a Measure of Revealed Preference Violations: A Comment," Journal of Political Economy, University of Chicago Press, vol. 121(6), pages 1248-1258.
    12. Hassin, Refael & Sarid, Anna, 2018. "Operations research applications of dichotomous search," European Journal of Operational Research, Elsevier, vol. 265(3), pages 795-812.
    13. Pursals, Salvador Casadesús & Garzón, Federico Garriga, 2009. "Optimal building evacuation time considering evacuation routes," European Journal of Operational Research, Elsevier, vol. 192(2), pages 692-699, January.
    14. Michael Holzhauser & Sven O. Krumke & Clemens Thielen, 2016. "Budget-constrained minimum cost flows," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1720-1745, May.
    15. Jianzhong Zhang & Zhenhong Liu, 2002. "A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm," Journal of Combinatorial Optimization, Springer, vol. 6(2), pages 207-227, June.
    16. Evgeny Gurevsky & Sergey Kovalev & Mikhail Y. Kovalyov, 2021. "Min-max controllable risk problems," 4OR, Springer, vol. 19(1), pages 93-101, March.
    17. Frenk, J.B.G. & Schaible, S., 2004. "Fractional Programming," ERIM Report Series Research in Management ERS-2004-074-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    18. Sergio Cabello, 2023. "Faster distance-based representative skyline and k-center along pareto front in the plane," Journal of Global Optimization, Springer, vol. 86(2), pages 441-466, June.
    19. Andrés Gómez & Oleg A. Prokopyev, 2021. "A Mixed-Integer Fractional Optimization Approach to Best Subset Selection," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 551-565, May.
    20. Akiyoshi Shioura, 2015. "Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 192-225, February.

    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:56:y:2013:i:3:p:1029-1043. 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.