The paper “An algorithm for ranking assignments using reoptimization” are now available online at C&OR.
You may also like
I have written a small note about mapping a multidimensional index into a unique id. An unique id might be useful e.g. […]
Submitted a draft of the working paper “Bicriterion shortest hyperpaths in random time-dependent networks”. Currently working on a improved branching rule for […]
The research paper “Biobjective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets” have been published in Informs Journal on Computing Abstract: […]
Togeather with 10 people we have started a study group on Bayesian Networks. We are going to read the book: Bayesian Networks […]