Lotsize optimization leading to a $p$-median problem with cardinalities

Simple item page
dc.creatorGaul, Constantin
dc.creatorKurz, Sascha
dc.creatorRambau, Joerg
dc.date2008-04-09
dc.date.accessioned2026-07-07T09:31:17Z
dc.date.available2026-07-07T09:31:17Z
dc.descriptionWe 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.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/0804.1408
dc.identifierhttp://arxiv.org/abs/0804.1408
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158404
dc.subjectOptimization and Control
dc.subject90B80; 90C59, 90C10
dc.titleLotsize optimization leading to a $p$-median problem with cardinalities
dc.typetext

Files

Collections

arXiv