The paper “An algorithm for ranking assignments using reoptimization” are now available online at C&OR.
You may also like
The last days I have been participating in a kick-off meeting for the Biosens II project. Using online measurements in milk models […]
The research paper “Biobjective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets” have been published in Informs Journal on Computing Abstract: […]
From August 14-28, 2006 Daniele Pretolani, University of Modena and Reggio Emilia, Italy visited me and Kim Allan Andersen. We did some […]
One of my PhD students, for who I am a co-supervisor, has just finished the defense of her thesis titled “Methods for […]