A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems

@article{Sherali1990AHO,
title={A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems},
author={Hanif D. Sherali and Warren P. Adams},
journal={SIAM J. Discrete Math.},
year={1990},
volume={3},
pages={411-430}
}

In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into a zero-one polynomial programming problem, and then relinearizes it into an extended linear program. It is shown that the strength of the resulting reformulation depends on the degree of the terms used to produce the polynomial program at the intermediate step of this method. In fact, as this degree varies from one up to the number of variables in the problem, aâ€¦Â CONTINUE READING