Tekniske rapporter 2008

A Branch-and-Cut Algorithm for the Elementary Shortest Path Problem with a Capacity Constraint (08-01)
Mads Kehlet Jepsen, Bjørn Petersen, Simon Spoorendonk
A note on the Flow Extended 0-1 Knapsack Cover Inequalities for the Elementary Shortest Path Problem with a Capacity Constraint (08-02)
Mads Kehlet Jepsen, Simon Spoorendonk
Working Together to Improve Usability: Challenges and Best Practices (08-03)
Mie Nørgaard, Kasper Hornbæk
Mammographic Pattern Recognition (08-04)
Jakob Raundahl
Virtual Machine Mobility with Self-Migration (08-05)
Jacob Gorm Hansen
Nesting Problems and Steiner Tree Problems (08-06)
Benny Kjær Nielsen
Computing the Maximum Detour of a Plane Graph in Subquadratic Time (08-07)
Christian Wulff-Nilsen
EBBA: Efficient Branch and Bound Algorithm for Protein Decoy Generation (08-08)
Martin Paluszewski og Pawel Winter
Bayes PCA Revisited (08-09)
Jon Sporring
Proceedings of the 16th Danish Conference on Pattern Recognition and Image Analysis (08-10)
Eds. Søren I. Olsen
Sum of All- Pairs Shortest Path Distances in a Planar Graph in Subquadratic time (08-11)
Christian Wulff-Nilsen
Protein Structure Prediction Using Bee Colony Optimization Metaheuristic (08-12)
R. Fonseca, M. Paluszewski and P. Winter
uFLIP: Understanding Flash IO Patterns (08-13)
Luc Bouganim, Björn Þór Jónsson and Philippe Bonnet
Inverse Kinematics using Quaternions (08-14)
Knud Henriksen, Kenny Erleben, and Morten Pol Engell-Nørregård
Liner Shipping Revenue Management with Respositioning of Empty Containers (08-15)
Berit Løfstedt, David Pisinger and Simon Spoorendonk
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time (08-16)
Christian Wulff - Nilsen