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 Info

To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

Publisher Info

Paper provided by University of Aarhus, Aarhus School of Business, Department of Business Studies in its series CORAL Working Papers with number L-2006-11.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 13 pages
Date of creation: 17 Nov 2006
Date of revision:
Handle: RePEc:hhb:aarbls:2006-011

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

For technical questions regarding this item, or to correct its listing, contact: (Helle Vinbaek Stenholt).

Related research

Keywords: 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)

Did you know? You may want to explore EconPapers, which displays the same data as IDEAS in a different way.

This page was last updated on 2009-11-28.