A note on the pivot and complement heuristic for 0-1 programming problems (Q1113801)

When solving large scale integer and mixed integer programming problems it is very important to find good feasible integer solutions at an early stage in the solution process. The pivot and complement heuristic is a procedure which very often generates good solutions at a relatively low computational cost. In this paper we demonstrate that repeated use of the pivot and complement heuristic with an additional objective function constraint, often gives a better solution than the one obtained in the first trial. We present some results obtained on a number of practical large scale problems of project sequencing type.