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
The research paper “An improved cut-and-solve algorithm for the single-source capacitated facility location problem” have been published in EURO Journal on Computational […]
The research paper “Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs” have been published in European […]
I an on a leave from the 29’th of July to the 4’th of November.
The VeRoLog 2012 conference in Boglogna has just ended. I gave a talk about “Ranking shortest paths in Stochastic time-denpendent networks”. The […]