The paper “K shortest paths in stochastic time-dependent networks” has been published as a working paper at the Department of Accounting, Finance and Logistics, Aarhus School of Business (see under publications).
You may also like
I am currently working on a project concerning optimal replacement strategies for sows with Erik Jørgensen. The problem is modelled using a […]
Erratum to “An algorithm for ranking assignments using reoptimization” [Computers and Operations Research 35 (2008) 3714-3726] is now available on-line. As pointed […]
The research paper “Biobjective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets” have been published in Informs Journal on Computing Abstract: […]
A new working paper “Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks” have been published.