Some specially structured assemble-to-order systems

Assemble-to-order systems are important in practice but challenging computationally. This paper combines some notions from combinatorial optimization, namely polymatroids and discrete convexity, to ease the computational burden significantly, for certain specially structured models. We point out that polymatroids have a concrete, intuitive interpretation in this context.