scientific article; zbMATH DE number 3619917

MaRDI QIDQ4182528zbMATH OpenFDO

Authors Manfred Padberg

Publication date 1977

zbMATH Keywords

Facet-Producing GraphSet Packing Polyhedra

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Graph theory (05C99)

Cited in

(17)

• The complexity of facets (and some facets of complexity)
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• On cutting-plane proofs in combinatorial optimization
• Polytope des independants d'un graphe série-parallèle
• Discrete extremal problems
• The maximum clique problem
• On the facets of the simple plant location packing polytope
• A new lifting theorem for vertex packing
• On the complete set packing and set partitioning polytopes: properties and rank 1 facets
• New facets for the two-stage uncapacitated facility location polytope
• Alternative formulations for the set packing problem and their application to the winner determination problem
• Some facets of the simple plant location polytope
• Classical cuts for mixed-integer programming and branch-and-cut
• New facets for the set packing polytope
• New variants of the simple plant location problem and applications
• A set packing model for the partition coloring problem
• Airline crew scheduling: state-of-the-art

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4182528)