1. A note on the pivot and complement heuristic for 0–1 programming problems;Aboudi;Operations Research Letters,1989
2. Tabu search for general zero–one integer programs using the Pivot and Complement heuristics;Aboudi;ORSA Journal of Computing,1994
3. Finding facets of the knapsack polytope which cut off a given point;Andonov;Comptes Rendus de l’Académie Bulgare des Sciences,1987
4. R. Andonov, S. Balev, A. Fréville, N. Yanev, A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem, Working paper, University of Valenciennes, presented at FRANCORO III, Québec, Canada, May 2001. Forthcoming in European Journal of Operational Research
5. Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms;Averbakh;Mathematical Programming,1994