Further facet generating procedures for vertex packing polytopes
From MaRDI portal
Publication:4119038
DOI10.1007/BF01580383zbMath0348.90148MaRDI QIDQ4119038
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Integer programming (90C10) Polytopes and polyhedra (52Bxx)
Related Items
On the 0,1 facets of the set covering polytope, The Boolean quadratic polytope: Some characteristics, facets and relatives, On cutting-plane proofs in combinatorial optimization, Facets and lifting procedures for the set covering polytope, On the complete set packing and set partitioning polytopes: properties and rank 1 facets, New variants of the simple plant location problem and applications, Polytope des independants d'un graphe série-parallèle, Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs, 2-clique-bond of stable set polyhedra, On the facets of lift-and-project relaxations under graph operations, Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs, New facets for the set packing polytope, A branch-and-cut algorithm for the maximum cardinality stable set problem, A polyhedral study of the generalized vertex packing problem, Gear composition and the stable set polytope, Weighted graphs defining facets: A connection between stable set and linear ordering polytopes, A New Facet Generating Procedure for the Stable Set Polytope, On the facets of the lift-and-project relaxations of graph subdivisions, A new lifting theorem for vertex packing, The complexity of facets (and some facets of complexity), Some facets of the simple plant location polytope
Cites Work
