| Article ID: | iaor19951117 |
| Country: | United Kingdom |
| Volume: | 1 |
| Issue: | 3 |
| Start Page Number: | 305 |
| End Page Number: | 316 |
| Publication Date: | Jul 1994 |
| Journal: | International Transactions in Operational Research |
| Authors: | Jrnsten K., Lkketangen A., Story S. |
| Keywords: | heuristics |
The Pivot and Complement heuristic is a procedure that frequently finds feasible solutions for general 0-1 integer programs. This paper presents a refinement of the heuristic based on Tabu Search techniques. Local search strategies for the search phase, as well as the improvement phase of the heuristic, are presented.