Lift-and-project ranks and antiblocker duality

Authors:
LáSzló LiptáK;Levent TunçEl
Affiliations:
Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA;Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ont., Canada N2L 3G1
Venue:
Operations Research Letters
Year:
2005

Citing 6
Cited 0

A hierarchy of relaxation between the continuous and convex hull representations

SIAM Journal on Discrete Mathematics
A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
The disjunctive procedure and blocker duality

Discrete Applied Mathematics
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Generalization of the Perfect Graph Theorem Under the Disjunctive Index

Mathematics of Operations Research
Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, "A Generalization of the Perfect Graph Theorem Under the Disjunctive Index"

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a very short proof of the beautiful result of Aguilera et al. that the BCC-rank of the clique polytope is invariant under complementation. Such properties do not extend to the N"0 and N procedures of Lovasz and Schrijver, or to the N"+ procedure unless P=NP.