Pith. sign in

REVIEW

The combinatorics of S, M, L, XL - The best fitting delivery of T-shirts

Not yet reviewed by Pith; the record is open.

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 1401.5572 v1 pith:E4M3GY5U submitted 2014-01-22 math.OC

classification math.OC
keywords branchdeliveryproblemappropriateapproximatingarisesavailablebesides
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 we provide an appropriate primal heuristic for this problem.

Discussion (0). Continue with ORCID to comment.

Pith tools