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/4799

Title: Minimax regret spanning arborescences under uncertain costs
Authors: Conde, E.
Candia, A.
Keywords: Robust optimization; Minimum spanning arborescences; Edmonds’ algorithm
Issue Date: 2007
Publisher: Elsevier B.V.
Citation: European Journal of Operational Research 182 (2): 561-577
Abstract: The paper considers a classical optimization problem on a network whose arc costs are partially known. It is assumed that an interval estimate is given for each arc cost and no further information about the statistical distribution of the truth value of the arc cost is known. In this context, given a spanning arborescence in the network, its cost can take on different values according to the choice of each individual arc cost, that is, according to the different cost scenarios. We analyze the problem of finding which spanning arborescence better approaches the optimal one under each possible scenario. The minimax regret criterion is proposed in order to obtain such a robust solution to the problem. In the paper, it is shown that a greedy-type algorithm can compute an optimal solution of this problem on acyclic networks. For general networks, the problem becomes -hard. In this case, the special structure of the optimization problem allows us to design a bounding process for the optimum value that will result in a heuristic algorithm described at the end of the paper.
Description: Candia, A. Department of Computer Science, Universidad de Talca, Merced 437, Curicó, Chile.
URI: http://dspace.utalca.cl/handle/1950/4799
ISSN: 0377-2217
Appears in Collections:Artículos en publicaciones ISI - Universidad de Talca

Files in This Item:

File Description SizeFormat
Full Text.htm2.88 kBHTMLView/Open

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