Author:
Fréville Arnaud,Hanafi SaÏd
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference153 articles.
1. Aboudi, R., A. Hallefjord, R. Helming, and K. Jornsten. (1989). “A Note on the Pivot and Complement Heuristic for 0-1 Programming Problems.” Operation Research Letters 8, 21–23.
2. Aboudi, R. and K. Jornsten. (1994). “Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristics.” ORSA Journal of Computing 6, 82–93.
3. Andonov, R., Balev S., A. Fréville, and N. Yanev. (2001). “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.
4. Averbakh, I. (1994). “Probabilistic Properties of the Dual Structure of the Multidimensional Knapsack Problem and Fast Statistically Efficient Algorithms.” Mathematical Programming 65, 311–330.
5. Balas, E., S. Ceria, M. Dawande, F. Margot, and G. Pataki. (2001). “OCTANE: A New Heuristic for Pure 0-1 Programs.” Operations Research 49, 207–225.
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献