Erratum to “An algorithm for ranking assignments using reoptimization” [Computers and Operations Research 35 (2008) 3714-3726] is now available on-line. As pointed out by Dr. A. Volgenant, we unfortunately missed one available implementation written by Miller et al. in IEEE Transactions on Aerospace and Electronic Systems.
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).
July 14-18, 2008 I participated in IBC – the XXIVth International Biometric Conference in Dublin. Here I presented a poster “Embedding a […]
The research paper “Quantifying walking and standing behaviour of dairy cows using a moving average based on output from an accelerometer” have […]
The research paper “Biobjective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets” have been published in Informs Journal on Computing Abstract: […]