An exact column-generation approach for the lot-type design problem

J\"org Rambau; Miriam Kie{\ss}ling; Sascha Kurz

REVIEW

An exact column-generation approach for the lot-type design problem

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1912.06062 v2 pith:CC3DOCVN submitted 2019-12-12 math.OC

Miriam Kie{ss}ling , Sascha Kurz , Jörg Rambau This is my paper · ORCID

classification math.OC

keywords approachexactinstancesproblemalgorithmsapproximatingassistedavailable

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We consider a fashion discounter distributing its many branches with integral multiples from a set of available lot-types. For the problem of approximating the branch and size dependent demand using those lots we propose a tailored exact column generation approach assisted by fast algorithms for intrinsic subproblems, which turns out to be very efficient on our real-world instances as well as on random instances.

Discussion (0). Continue with ORCID to comment.

Pith tools