The paper “An algorithm for ranking assignments using reoptimization” are now available online at C&OR.
You may also like
The report “Finding the K shortest hyperpaths using reoptimization” has been accepted for publication in Operations Research Letters (see under publications).
I have written a small note about mapping a multidimensional index into a unique id. An unique id might be useful e.g. […]
Today I am participating in a kick-off meeting of the project ‘The intelligent Farrowing Pen’. The four-year project is supported by Højteknologifonden, […]
Sune one of my PhD students has just finished his defense of his thesis titled “Discrete Location Problems – Theory, Algorithms, and Extensions to Multiple […]