The paper “An algorithm for ranking assignments using reoptimization” are now available online at C&OR.
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: […]
Sune one of my PhD students has just finished his defense of his thesis titled “Discrete Location Problems – Theory, Algorithms, and Extensions to Multiple […]
The last days 5-9 November I have been visiting Professor Anders Ringgaard Kristensen at KU Life. We have been working on a […]
The paper “Bicriterion shortest paths in stochastic time-dependent networks” have been accepted for publication in Lecture Notes in Economics and Mathematical Systems.