Author:
Glover Fred,Kochenberger Gary A.
Reference15 articles.
1. R. Aboudi and K. Jornsten (1994) “Tabu Search for General Zero Integer Programs Using the Pivot and Complement Heuristic,” ORSA Journal on Computing, Vol. 6, No. 1, Winter 1994, pp. 82–93.
2. J. Beasley (1995) “OR-Library,” available by anonymous ftp to msemga.ms.ic.ac.uk.
3. F. Dammeyer and S. Voss (1993) “Dynamic Tabu List Management Using Reverse Elimination Method,” Annals of Operations Research, No. 41, pp. 31–46.
4. A. Drexl (1987) “A Simulated Annealing Approach to the Multiconstraint Zero-One Knapsack Problem,” Computing, No. 40, pp. 1–8.
5. A. Fréville and G. Plateau (1986) “Heuristics and Reduction Methods for Multiple Constraints 0–1 Linear Programming Problems,” European Journal of Operations Research, No. 24, pp. 206–215.
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献