A note on “Multicriteria adaptive paths in stochastic, time-varying networks”
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University of Aarhus, Aarhus School of Business, Department of Business Studies in its series CORAL Working Papers with number L-2006-11.
Length: 13 pages
Date of creation: 17 Nov 2006
Date of revision:
Contact details of provider:
Postal: The Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Fax: + 45 86 15 19 43
Web page: http://www.asb.dk/about/departments/bs.aspx
More information through EDIRC
Multiple objective programming; shortest paths; stochastic time-dependent networks; time-adaptive strategies;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2007-06-18 (All new papers)
- NEP-CMP-2007-06-18 (Computational Economics)
- NEP-NET-2007-06-18 (Network Economics)
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Helle Vinbaek Stenholt).
If references are entirely missing, you can add them using this form.