IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v198y2009i1p232-240.html
   My bibliography  Save this article

Optimality conditions in preference-based spanning tree problems

Author

Listed:
  • Alonso, Sergio
  • Domínguez-Ríos, Miguel Ángel
  • Colebrook, Marcos
  • Sedeo-Noda, Antonio

Abstract

Spanning tree problems defined in a preference-based environment are addressed. In this approach, optimality conditions for the minimum-weight spanning tree problem (MST) are generalized for use with other, more general preference orders. The main goal of this paper is to determine which properties of the preference relations are sufficient to assure that the set of 'most-preferred' trees is the set of spanning trees verifying the optimality conditions. Finally, algorithms for the construction of the set of spanning trees fulfilling the optimality conditions are designed, improving the methods in previous papers.

Suggested Citation

  • Alonso, Sergio & Domínguez-Ríos, Miguel Ángel & Colebrook, Marcos & Sedeo-Noda, Antonio, 2009. "Optimality conditions in preference-based spanning tree problems," European Journal of Operational Research, Elsevier, vol. 198(1), pages 232-240, October.
  • Handle: RePEc:eee:ejores:v:198:y:2009:i:1:p:232-240
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00672-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Perny, Patrice & Spanjaard, Olivier, 2005. "A preference-based approach to spanning trees and shortest paths problems***," European Journal of Operational Research, Elsevier, vol. 162(3), pages 584-601, May.
    2. Ramos, R. M. & Alonso, S. & Sicilia, J. & Gonzalez, C., 1998. "The problem of the optimal biobjective spanning tree," European Journal of Operational Research, Elsevier, vol. 111(3), pages 617-628, December.
    3. Knowles, Joshua D. & Corne, David W., 2002. "Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm," European Journal of Operational Research, Elsevier, vol. 143(3), pages 543-547, December.
    4. Colebrook, Marcos & Sicilia, Joaquin, 2007. "A polynomial algorithm for the multicriteria cent-dian location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1008-1024, June.
    5. Zhou, Gengui & Gen, Mitsuo, 1999. "Genetic algorithm approach on multi-criteria minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 114(1), pages 141-152, April.
    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. I. F. C. Fernandes & E. F. G. Goldbarg & S. M. D. M. Maia & M. C. Goldbarg, 2020. "Empirical study of exact algorithms for the multi-objective spanning tree," Computational Optimization and Applications, Springer, vol. 75(2), pages 561-605, March.

    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. I. F. C. Fernandes & E. F. G. Goldbarg & S. M. D. M. Maia & M. C. Goldbarg, 2020. "Empirical study of exact algorithms for the multi-objective spanning tree," Computational Optimization and Applications, Springer, vol. 75(2), pages 561-605, March.
    2. Perny, Patrice & Spanjaard, Olivier, 2005. "A preference-based approach to spanning trees and shortest paths problems***," European Journal of Operational Research, Elsevier, vol. 162(3), pages 584-601, May.
    3. Francis Sourd & Olivier Spanjaard, 2008. "A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 472-484, August.
    4. Andréa Santos & Diego Lima & Dario Aloise, 2014. "Modeling and solving the bi-objective minimum diameter-cost spanning tree problem," Journal of Global Optimization, Springer, vol. 60(2), pages 195-216, October.
    5. Altannar Chinchuluun & Panos Pardalos, 2007. "A survey of recent developments in multiobjective optimization," Annals of Operations Research, Springer, vol. 154(1), pages 29-50, October.
    6. José Arroyo & Pedro Vieira & Dalessandro Vianna, 2008. "A GRASP algorithm for the multi-criteria minimum spanning tree problem," Annals of Operations Research, Springer, vol. 159(1), pages 125-133, March.
    7. Pedro Correia & Luís Paquete & José Rui Figueira, 2021. "Finding multi-objective supported efficient spanning trees," Computational Optimization and Applications, Springer, vol. 78(2), pages 491-528, March.
    8. Lacour, Renaud, 2014. "Approches de résolution exacte et approchée en optimisation combinatoire multi-objectif, application au problème de l'arbre couvrant de poids minimal," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14806 edited by Vanderpooten, Daniel.
    9. Cristina Requejo & Eulália Santos, 2020. "Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms," Operational Research, Springer, vol. 20(4), pages 2467-2495, December.
    10. Delorme, Xavier & Gandibleux, Xavier & Degoutin, Fabien, 2010. "Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 206-217, July.
    11. Juan Villegas & Fernando Palacios & Andrés Medaglia, 2006. "Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example," Annals of Operations Research, Springer, vol. 147(1), pages 109-141, October.
    12. Zhou, Gengui & Min, Hokey & Gen, Mitsuo, 2003. "A genetic algorithm approach to the bi-criteria allocation of customers to warehouses," International Journal of Production Economics, Elsevier, vol. 86(1), pages 35-45, October.
    13. Wen, Hao & Sang, Song & Qiu, Chenhui & Du, Xiangrui & Zhu, Xiao & Shi, Qian, 2019. "A new optimization method of wind turbine airfoil performance based on Bessel equation and GABP artificial neural network," Energy, Elsevier, vol. 187(C).
    14. Holzmann, Tim & Smith, J.C., 2018. "Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations," European Journal of Operational Research, Elsevier, vol. 271(2), pages 436-449.
    15. Brazil, M. & Ras, C.J. & Thomas, D.A., 2014. "A geometric characterisation of the quadratic min-power centre," European Journal of Operational Research, Elsevier, vol. 233(1), pages 34-42.
    16. Banu Lokman & Murat Köksalan, 2013. "Finding all nondominated points of multi-objective integer programs," Journal of Global Optimization, Springer, vol. 57(2), pages 347-365, October.
    17. Ehrgott, Matthias & Skriver, Anders J. V., 2003. "Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach," European Journal of Operational Research, Elsevier, vol. 147(3), pages 657-664, June.
    18. Knowles, Joshua D. & Corne, David W., 2002. "Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm," European Journal of Operational Research, Elsevier, vol. 143(3), pages 543-547, December.
    19. Diabat, Ali & Kannan, Devika & Kaliyan, Mathiyazhagan & Svetinovic, Davor, 2013. "An optimization model for product returns using genetic algorithms and artificial immune system," Resources, Conservation & Recycling, Elsevier, vol. 74(C), pages 156-169.
    20. Dali Jiang & Haitao Li & Tinghong Yang & De Li, 2016. "Genetic algorithm for inventory positioning problem with general acyclic supply chain networks," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 10(3), pages 367-384.

    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:eee:ejores:v:198:y:2009:i:1:p:232-240. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.