The paper “An algorithm for ranking assignments using reoptimization” are now available online at C&OR.
You may also like
En populærvidenskabelig artikel er netop udkommet i OrBit omkring min MDP model for udskiftning af malkekvæg. “Det optimale udskiftningstidspunkt for en malkeko“, […]
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 research paper “Optimizing pig marketing decisions under price fluctuations” have been published in Annals of Operations Research. Abstract: In the manufacturing […]
Togeather with 10 people we have started a study group on Bayesian Networks. We are going to read the book: Bayesian Networks […]