scientific article
From MaRDI portal
Publication:3892882
zbMath0447.52010MaRDI QIDQ3892882
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Polytopes and polyhedra (52Bxx)
Related Items
New formulations for the uncapacitated multiple allocation hub location problem, Alternative formulations for the set packing problem and their application to the winner determination problem, On the 0,1 facets of the set covering polytope, A generalization of antiwebs to independence systems and their canonical facets, On cutting-plane proofs in combinatorial optimization, On the complete set packing and set partitioning polytopes: properties and rank 1 facets, Rank inequalities and separation algorithms for packing designs and sparse triple systems., Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, On the mixed set covering, packing and partitioning polytope, New facets for the set packing polytope, Unnamed Item, Facets and algorithms for capacitated lot sizing, A note on node packing polytopes on hypergraphs, On the facets of the simple plant location packing polytope, The complexity of facets (and some facets of complexity), Some facets of the simple plant location polytope
