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 “Biobjective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets” have been published in Informs Journal on Computing Abstract: […]
Finished a draft on bricriterion shortest hyperpaths in random time-dependent networks (see publications). Summer School: “Nordic Summer School on Applied Optimization and […]
The research paper “A bi-objective approach to discrete cost-bottleneck location problems” have been published in Annals of Operations Research. Abstract: This paper considers […]
The paper “An algorithm for ranking assignments using reoptimization” are now available online at C&OR.