TY - GEN A1 - Raack, Christian A1 - Koster, Arie M. C. A. T1 - A packing integer program arising in two-layer network design N2 - In this paper we study a certain cardinality constrained packing integer program which is motivated by the problem of dimensioning a cut in a two-layer network. We prove NP-hardness and consider the facial structure of the corresponding polytope. We provide a complete description for the smallest nontrivial case and develop two general classes of facet-defining inequalities. This approach extends the notion of the well known cutset inequalities to two network layers. KW - Packing integer programming KW - Multi-layer network design KW - Cutset inequalities Y1 - 2009 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/641 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-6410 ER -