The VeRoLog 2012 conference in Boglogna has just ended. I gave a talk about “Ranking shortest paths in Stochastic time-denpendent networks”. The conference had approximately 160 participants.
You may also like
Daniele Pretolani had the opportunity to come to Denmark for a month to visit my former supervisor Kim Allan Andersen and me. […]
The paper “An algorithm for ranking assignments using reoptimization” are now available online at C&OR.
Den 25 november 2008 afholder DORS en dag om anvendelser af OR på Handelshøjskolen i Århus, hvor jeg deltager med en præsentation. […]
The research paper “Biobjective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets” have been published in Informs Journal on Computing Abstract: […]