Jakob Krarup

Learn More
This paper presents a history of a difficult facility layout problem that falls into the category of the Koopmans-Beckmann variant of the Quadratic Assignment Problem (QAP), wherein 30 facilities are to be assigned to 30 locations. The problem arose in 1972 as part of the design of a German university hospital, Klinikum Regensburg. This problem, known as(More)
A highly efficient algorithm (HK) devised by Held and Karp for solving the symmetric traveling-salesman problem was presented at the 7th Mathematical Programming Symposium in 1970 and published in Mathematical Programming in 1971. Its outstanding performance is due to a clever exploitation of the relationship between the traveling-salesman problem and(More)