90B80 Discrete location and assignment [See also 90C10]
1 search hit

Lotsize optimization leading to a pmedian problem with cardinalities
(2007)

Constantin Gaul
Sascha Kurz
Jörg Rambau
 We consider the problem of approximating the branch and size dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available lottypes. We propose a formalized model which arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation and a primal heuristic for this problem we also consider a more abstract version which we relate to several other classical optimization problems like the pmedian problem, the facility location problem or the matching problem.