Balas, Egon; Martin, Clarence H. - In: Management Science 26 (1980) 1, pp. 86-96
Pivot and Complement is a heuristic for finding approximate solutions to 0-1 programming problems. It uses the fact that a 0-1 program is equivalent to the associated linear program with the added requirement that all slack variables, other than those in the upper bounding constraints, be basic....