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

A preference-based approach to spanning trees and shortest paths problems***

Author

Listed:
  • Perny, Patrice
  • Spanjaard, Olivier

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:162:y:2005:i:3:p:584-601
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00017-7
    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. White, Chelsea C. & Stewart, Bradley S. & Carraway, Robert L., 1992. "Multiobjective, preference-based search in acyclic OR-graphs," European Journal of Operational Research, Elsevier, vol. 56(3), pages 357-363, February.
    2. Current, John & Marsh, Michael, 1993. "Multiobjective transportation network design and routing problems: Taxonomy and annotation," European Journal of Operational Research, Elsevier, vol. 65(1), pages 4-19, February.
    3. Dias, Luis C. & Climaco, Joao N., 2000. "Shortest path problems with partial information: Models and algorithms for detecting dominance," European Journal of Operational Research, Elsevier, vol. 121(1), pages 16-31, February.
    4. Schwartz, Thomas, 1976. "Choice functions, "rationality" conditions, and variations on the weak axiom of revealed preference," Journal of Economic Theory, Elsevier, vol. 13(3), pages 414-427, December.
    5. Mote, John & Murthy, Ishwar & Olson, David L., 1991. "A parametric approach to solving bicriterion shortest path problems," European Journal of Operational Research, Elsevier, vol. 53(1), pages 81-92, July.
    6. 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.
    7. Tung Tung, Chi & Lin Chew, Kim, 1992. "A multicriteria Pareto-optimal path algorithm," European Journal of Operational Research, Elsevier, vol. 62(2), pages 203-209, October.
    8. Martins, Ernesto Queiros Vieira, 1984. "On a multicriteria shortest path problem," European Journal of Operational Research, Elsevier, vol. 16(2), pages 236-245, May.
    9. 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. 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.
    2. 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.
    3. Andreas Darmann & Christian Klamler & Ulrich Pferschy, 2011. "Finding socially best spanning trees," Theory and Decision, Springer, vol. 70(4), pages 511-527, April.

    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. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
    2. Granat, Janusz & Guerriero, Francesca, 2003. "The interactive analysis of the multicriteria shortest path problem by the reference point method," European Journal of Operational Research, Elsevier, vol. 151(1), pages 103-118, November.
    3. Soroush, H.M., 2008. "Optimal paths in bi-attribute networks with fractional cost functions," European Journal of Operational Research, Elsevier, vol. 190(3), pages 633-658, November.
    4. F. Guerriero & R. Musmanno, 2001. "Label Correcting Methods to Solve Multicriteria Shortest Path Problems," Journal of Optimization Theory and Applications, Springer, vol. 111(3), pages 589-613, December.
    5. de Lima Pinto, Leizer & Bornstein, Cláudio Thomás & Maculan, Nelson, 2009. "The tricriterion shortest path problem with at least two bottleneck objective functions," European Journal of Operational Research, Elsevier, vol. 198(2), pages 387-391, October.
    6. Duque, Daniel & Lozano, Leonardo & Medaglia, Andrés L., 2015. "An exact method for the biobjective shortest path problem for large-scale road networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 788-797.
    7. 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.
    8. Iori, Manuel & Martello, Silvano & Pretolani, Daniele, 2010. "An aggregate label setting policy for the multi-objective shortest path problem," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1489-1496, December.
    9. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
    10. 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.
    11. Xue, Li & Luo, Zhixing & Lim, Andrew, 2015. "Two exact algorithms for the traveling umpire problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 932-943.
    12. 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.
    13. Suvrajeet Sen & Rekha Pillai & Shirish Joshi & Ajay K. Rathi, 2001. "A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems," Transportation Science, INFORMS, vol. 35(1), pages 37-49, February.
    14. Sedeño-noda, Antonio & Colebrook, Marcos, 2019. "A biobjective Dijkstra algorithm," European Journal of Operational Research, Elsevier, vol. 276(1), pages 106-118.
    15. Machuca, E. & Mandow, L. & Pérez de la Cruz, J.L. & Ruiz-Sepulveda, A., 2012. "A comparison of heuristic best-first algorithms for bicriterion shortest path problems," European Journal of Operational Research, Elsevier, vol. 217(1), pages 44-53.
    16. Pulido, Francisco Javier & Mandow, Lawrence & Pérez de la Cruz, José Luis, 2014. "Multiobjective shortest path problems with lexicographic goal-based preferences," European Journal of Operational Research, Elsevier, vol. 239(1), pages 89-101.
    17. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
    18. Yannick Kergosien & Antoine Giret & Emmanuel Néron & Gaël Sauvanet, 2022. "An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 76-92, January.
    19. 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.
    20. B. Boffey & Francisco García & Gilbert Laporte & Juan Mesa & Blas Pelegrín, 1995. "Multiobjective routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 3(2), pages 167-220, December.

    More about this item

    Statistics

    Access and download statistics

    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:162:y:2005:i:3:p:584-601. 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.