Valid Inequalities and Superadditivity for 0–1 Integer Programs
Data up to Jan 2025
Total Citations Per Year
Abstract
References (14)
Integer programming
1972 • 3,508 citations
On the facial structure of set packing polyhedra
1973 • 588 citations
Blocking and anti-blocking pairs of polyhedra
1971 • 534 citations
Disjunctive programming: Properties of the convex hull of feasible points
1998 • 434 citations
Facets of the knapsack polytope
1975 • 397 citations
Some polyhedra related to combinatorial problems
1969 • 395 citations
Properties of vertex packing and independence system polyhedra
1974 • 360 citations
Faces for a linear inequality in 0–1 variables
1975 • 304 citations
Some continuous functions related to corner polyhedra
1972 • 251 citations
Facets of the Knapsack Polytope From Minimal Covers
1978 • 202 citations
On the group problem for mixed integer programming
1974 • 127 citations
Technical Note—Facets and Strong Valid Inequalities for Integer Programs
1976 • 89 citations
Valid Inequalities, Covering Problems and Discrete Dynamic Programs
1977 • 30 citations
Deleted Work
1955 • 0 citations