Wheel inequalities and their separation algorithms for the stable set

Conference · Fri Dec 30 23:00:00 EST 1994

OSTI ID:35896

Cheng, E; Cunningham, W ^[1]

---

1. Univ. of Waterloo (Canada)

Let G = (V, E) be a graph. A stable set in G is a set of pairwise non-adjacent nodes. The stable set polytope P{sub G} of G, is the convex hull of incidence vectors of all stable sets in G. We introduce several new classes of valid inequalities for P{sub G} (wheel inequalities) and show that their corresponding separation problems can be solved in polynomial time. The most basic classes arise from subgraphs that are subdivisions of wheels. These generate two classes of inequalities, one of which generalizes {open_quotes}odd K{sub 4}{close_quotes} inequalities introduced previously. We will discuss some conditions for these inequalities to be facet-inducing for P{sub G}.

• OSTI ID: 35896
• Report Number(s): CONF-9408161--
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
LINEAR PROGRAMMING
MATRICES
NUMERICAL SOLUTION
STATISTICAL MODELS