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: […]
The last days I have been participating in a kick-off meeting for the Biosens II project. Using online measurements in milk models […]
From 17-22 June 2013 I have been participating in MCDM 2013 in Malaga. The 22nd International Conference on Multiple Criteria Decision Making. […]
The 16th of October I gave a presentation to a group of students at KU Life about optimal replacement policies for dairy […]