论文信息 - Tabu search within a pivot and complement framework

Tabu search within a pivot and complement framework

Abstract The Pivot and Complement heuriitic is a procedure that frequently finds feasible solutions for general 0–1 integer programs. We present 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.

[1] E. Balas,et al. Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .

[2] S. Senju,et al. An Approach to Linear Programming with 0--1 Variables , 1968 .

[3] M. Fischetti,et al. Weighted k-cardinality trees , 1992 .

[4] Kurt Jörnsten,et al. Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic , 1994, INFORMS J. Comput..

[5] Fred Glover,et al. Tabu Search: A Tutorial , 1990 .

[6] Wei Shih,et al. A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .

[7] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..

[8] Clifford C. Petersen,et al. Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .