Jakob Krarup

TL;DR: In this paper, the authors consider a family of discrete, deterministic, single-criterion, NP-hard problems, including set packing, set covering, and set partitioning.

TL;DR: A conceptually straightforward method for generating sharp lower bounds constitutes the basic element in a family of efficient branch and bound algorithms for solving simple (uncapacitated) plant location problems and special versions hereof including set covering and set partitioning.

TL;DR: Within the general problem area of location problems, the layout planning problem or facilities location problem has for years attracted the attention of building planners (architects, industrial engineers, and operations researchers).

TL;DR: In this article, a polynomially bounded algorithm for the plant location problem for which the coefficient matrix possesses certain properties is proposed, by means of which an optimal solution can be derived after a single pass.

TL;DR: 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 is presented.