Lotsize optimization leading to a p-median problem with cardinalities
From MaRDI portal
Publication:6209064
arXiv0804.1408MaRDI QIDQ6209064FDOQ6209064
Authors: Constantin Gaul, Sascha Kurz, Jörg Rambau 
Publication date: 9 April 2008
Abstract: 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 lot-types. 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 p-median problem, the facility location problem or the matching problem.
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)
This page was built for publication: Lotsize optimization leading to a $p$-median problem with cardinalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6209064)
