A note on the Pivot and Complement heuristic for 0-1 programming problems

A note on the Pivot and Complement heuristic for 0-1 programming problems

0.00 Avg rating0 Votes
Article ID: iaor1989702
Country: Netherlands
Volume: 8
Issue: 1
Start Page Number: 21
End Page Number: 23
Publication Date: Feb 1989
Journal: Operations Research Letters
Authors: , , ,
Abstract:

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 the authors 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. They present some results obtained on a number of practical large scale problems of project sequencing type.

Reviews

Required fields are marked *. Your email address will not be published.