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

Minimax regret spanning arborescences under uncertain costs

Author

Listed:
  • Conde, Eduardo
  • Candia, Alfredo

Abstract

No abstract is available for this item.

Suggested Citation

  • Conde, Eduardo & Candia, Alfredo, 2007. "Minimax regret spanning arborescences under uncertain costs," European Journal of Operational Research, Elsevier, vol. 182(2), pages 561-577, October.
    • Handle: RePEc:eee:ejores:v:182:y:2007:i:2:p:561-577
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00848-4
    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. Branzei, Rodica & Mallozzi, Lina & Tijs, Stef, 2003. "Supermodular games and potential games," Journal of Mathematical Economics, Elsevier, vol. 39(1-2), pages 39-49, February.
    2. Montemanni, R. & Gambardella, L. M., 2005. "A branch and bound algorithm for the robust spanning tree problem with interval data," European Journal of Operational Research, Elsevier, vol. 161(3), pages 771-779, March.
    3. Zielinski, Pawel, 2004. "The computational complexity of the relative robust shortest path problem with interval data," European Journal of Operational Research, Elsevier, vol. 158(3), pages 570-576, November.
    4. Brânzei, R. & Mallozzi, L. & Tijs, S.H., 2003. "Supermodular games and potential games," Other publications TiSEM 87c16860-0596-4448-808d-c, Tilburg University, School of Economics and Management.
    5. Montemanni, Roberto, 2006. "A Benders decomposition approach for the robust spanning tree problem with interval data," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1479-1490, November.
    6. Matteo Fischetti & Paolo Toth, 1993. "An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs," INFORMS Journal on Computing, INFORMS, vol. 5(4), pages 426-434, November.
    7. Antonio Alonso-Ayuso & Paolo Detti & Laureano Escudero & M. Ortuño, 2003. "On Dual Based Lower Bounds for the Sequential Ordering Problem with Precedences and Due Dates," Annals of Operations Research, Springer, vol. 124(1), pages 111-131, 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. P. W. Heijnen & A. Ligtvoet & R. M. Stikkelman & P. M. Herder, 2014. "Maximising the Worth of Nascent Networks," Networks and Spatial Economics, Springer, vol. 14(1), pages 27-46, March.
    2. Mariusz Makuchowski, 2014. "Perturbation algorithm for a minimax regret minimum spanning tree problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(1), pages 37-49.

    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. Conde, Eduardo, 2012. "On a constant factor approximation for minmax regret problems using a symmetry point scenario," European Journal of Operational Research, Elsevier, vol. 219(2), pages 452-457.
    2. Christian Ewerhart, 2020. "Ordinal potentials in smooth games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(4), pages 1069-1100, November.
    3. Duersch, Peter & Oechssler, Jörg & Schipper, Burkhard C., 2012. "Unbeatable imitation," Games and Economic Behavior, Elsevier, vol. 76(1), pages 88-96.
    4. Peter Duersch & Jörg Oechssler & Burkhard Schipper, 2014. "When is tit-for-tat unbeatable?," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(1), pages 25-36, February.
    5. Alireza Amirteimoori & Simin Masrouri, 2021. "DEA-based competition strategy in the presence of undesirable products: An application to paper mills," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 5-21.
    6. Keyzer, Michiel & van Wesenbeeck, Lia, 2005. "Equilibrium selection in games: the mollifier method," Journal of Mathematical Economics, Elsevier, vol. 41(3), pages 285-301, April.
    7. Peter Duersch & Jörg Oechssler & Burkhard Schipper, 2012. "Pure strategy equilibria in symmetric two-player zero-sum games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(3), pages 553-564, August.
    8. Peter Duersch & Jörg Oechssler & Burkhard Schipper, 2014. "When is tit-for-tat unbeatable?," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(1), pages 25-36, February.
    9. Francesco Caruso & Maria Carmela Ceparano & Jacqueline Morgan, 2020. "Best response algorithms in ratio-bounded games: convergence of affine relaxations to Nash equilibria," CSEF Working Papers 593, Centre for Studies in Economics and Finance (CSEF), University of Naples, Italy.
    10. Burkhard Schipper & Peter Duersch & Joerg Oechssler, 2011. "Once Beaten, Never Again: Imitation in Two-Player Potential Games," Working Papers 26, University of California, Davis, Department of Economics.
    11. Lina Mallozzi, 2013. "An application of optimization theory to the study of equilibria for games: a survey," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 523-539, September.
    12. Burkhard C. Schipper & Peter Duersch & Joerg Oechssler, 2010. "Pure Saddle Points and Symmetric Relative Payoff Games," Working Papers 301, University of California, Davis, Department of Economics.
    13. Ewerhart, Christian, 2017. "The lottery contest is a best-response potential game," Economics Letters, Elsevier, vol. 155(C), pages 168-171.
    14. Burkhard Schipper & Peter Duersch & Joerg Oechssler, 2011. "Once Beaten, Never Again: Imitation in Two-Player Potential Games," Working Papers 1112, University of California, Davis, Department of Economics.
    15. Arsen Palestini & Ilaria Poggio, 2015. "A Bayesian potential game to illustrate heterogeneity in cost/benefit characteristics," International Review of Economics, Springer;Happiness Economics and Interpersonal Relations (HEIRS), vol. 62(1), pages 23-39, March.
    16. Chen, Xujin & Hu, Jie & Hu, Xiaodong, 2009. "A polynomial solvable minimum risk spanning tree problem with interval data," European Journal of Operational Research, Elsevier, vol. 198(1), pages 43-46, October.
    17. Nikulin, Y. & Karelkina, O. & Mäkelä, M.M., 2013. "On accuracy, robustness and tolerances in vector Boolean optimization," European Journal of Operational Research, Elsevier, vol. 224(3), pages 449-457.
    18. Wei Wu & Manuel Iori & Silvano Martello & Mutsunori Yagiura, 2022. "An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2523-2539, September.
    19. David González-Sánchez & Onésimo Hernández-Lerma, 2014. "Dynamic Potential Games: The Discrete-Time Stochastic Case," Dynamic Games and Applications, Springer, vol. 4(3), pages 309-328, September.
    20. Zhang, Guoquan & Shang, Jennifer & Yildirim, Pinar, 2016. "Optimal pricing for group buying with network effects," Omega, Elsevier, vol. 63(C), pages 69-82.

    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:182:y:2007:i:2:p:561-577. 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.