Pages that link to "Item:Q4119038"

The following pages link to Further facet generating procedures for vertex packing polytopes (Q4119038):

Displaying 21 items.

• Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
• Gear composition and the stable set polytope (Q1003487) (← links)
• Weighted graphs defining facets: A connection between stable set and linear ordering polytopes (Q1013288) (← links)
• The complexity of facets (and some facets of complexity) (Q1061485) (← links)
• On the 0,1 facets of the set covering polytope (Q1122477) (← links)
• The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
• On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
• Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
• Polytope des independants d'un graphe série-parallèle (Q1147168) (← links)
• A new lifting theorem for vertex packing (Q2329651) (← links)
• On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
• 2-clique-bond of stable set polyhedra (Q2446841) (← links)
• On the facets of lift-and-project relaxations under graph operations (Q2448871) (← links)
• A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
• Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
• A New Facet Generating Procedure for the Stable Set Polytope (Q2840706) (← links)
• On the facets of the lift-and-project relaxations of graph subdivisions (Q2840709) (← links)
• Some facets of the simple plant location polytope (Q3945954) (← links)
• New facets for the set packing polytope (Q5929145) (← links)
• A branch-and-cut algorithm for the maximum cardinality stable set problem (Q5940036) (← links)
• New variants of the simple plant location problem and applications (Q6106762) (← links)