Daniele Pretolani (), Lars Relund Nielsen () and Kim Allan Andersen ()
Additional contact information
Daniele Pretolani: Department of Sciences and Methods of Engineering, Postal: University of Modena and Reggio Emilia, Via Amendola 2, I-42100 Reggio Emilia, Italy
Lars Relund Nielsen: Research Unit of Statistics and Decision Analysis, Postal: DIAS, P.O. Box 50, DK-8830 Tjele, Denmark,
Kim Allan Andersen: Department of Business Studies, Aarhus School of Business, Postal: The Aarhus School of Business, Fuglesangs Allé 4, 8210 Aarhus V, Denmark
Abstract: In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in
stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property that does not hold in general. Opasanon and Miller-Hooks also propose an algorithm for solving a parametric problem. We give a simplified algorithm which is linear in the input size.
Keywords: Multiple objective programming; shortest paths; stochastic time-dependent networks; time-adaptive strategies
13 pages, November 17, 2006
Full text files
L_2006_11.pdf![]()
Questions (including download problems) about the papers in this series should be directed to Helle Vinbaek Stenholt ()
Report other problems with accessing this service to Sune Karlsson ().
RePEc:hhb:aarbls:2006-011This page generated on 2024-09-13 22:18:12.