The paper “A note on ranking assignments using reoptimization” has been published as a working paper at the Department of Operations Research, University of Aarhus (see under publications).
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: […]
I am currently working on a project concerning optimal replacement strategies for sows with Erik Jørgensen. The problem is modelled using a […]
Daniele Pretolani had the opportunity to come to Denmark for a month to visit my former supervisor Kim Allan Andersen and me. […]
Erratum to “An algorithm for ranking assignments using reoptimization” [Computers and Operations Research 35 (2008) 3714-3726] is now available on-line. As pointed […]