The paper “Finding the K shortest hyperpaths” has been published in Computers and Operations Research (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: […]
En populærvidenskabelig artikel er netop udkommet i OrBit omkring min MDP model for udskiftning af malkekvæg. “Det optimale udskiftningstidspunkt for en malkeko“, […]
Den 25 november 2008 afholder DORS en dag om anvendelser af OR på Handelshøjskolen i Århus, hvor jeg deltager med en præsentation. […]
The 9.-11. September I have been participating in OR50 – The UK OR Society’s 50’th conference in York. The conference was held […]