Integer and combinatorial optimization
Integer and combinatorial optimization
A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
Single-machine scheduling polyhedra with precedence constraints
Mathematics of Operations Research
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
Projection and Lifting in Combinatorial Optimization
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
| Hi-index | 0.00 |
Projection of a polyhedron involves the use of a conewhose extreme rays induce the inequalities defining the projection.These inequalities need not be facet defining. We introduce atransformation that produces a cone whose extremerays induce facets of the projection.