DSpace About DSpace Software

DSpace Biblioteca Universidad de Talca (v1.5.2) >
Dirección de Investigación >
Artículos en publicaciones ISI - Universidad de Talca >

Please use this identifier to cite or link to this item: http://dspace.utalca.cl/handle/1950/10207

Title: On exact solutions for the Minmax Regret Spanning Tree problem
Authors: Perez-Galarce, F.
Alvarez-Miranda, E.
Candia-Vejar, A.
Toth, P.
Keywords: Branch-and-cut
Benders decomposition
Minimum Spanning Tree
Minmax regret
Robust optimization
Interval uncertainty
Issue Date: Jul-2014
Abstract: The Minmax Regret Spanning Tree problem is studied in this paper. This is a generalization of the well-known Minimum Spanning Tree problem, which considers uncertainty in the cost function. Particularly, it is assumed that the cost parameter associated with each edge is an interval whose lower and upper limits are known, and the Minmax Regret is the optimization criterion. The Minmax Regret Spanning Tree problem is an NP-Hard optimization problem for which exact and heuristic approaches have been proposed. Several exact algorithms are proposed and computationally compared with the most effective approaches of the literature. It is shown that a proposed branch-and-cut approach outperforms the previous approaches when considering several classes of instances from the literature. (C) 2014 Elsevier Ltd. All rights reserved.
Description: Univ Talca, Programa Magister Gest Operac, Curico, Chile; Perez-Galarce, F (Perez-Galarce, Francisco); Alvarez-Miranda, E (Alvarez-Miranda, Eduardo); Candia-Vejar, A (Candia-Vejar, Alfredo)
URI: http://dspace.utalca.cl/handle/1950/10207
ISSN: 1873-765X
Appears in Collections:Artículos en publicaciones ISI - Universidad de Talca

Files in This Item:

File Description SizeFormat

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2009  The DSpace Foundation - Feedback