Author:
Thiongane Babacar,Nagih Anass,Plateau Gérard
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference49 articles.
1. Balas, E. and E. Zemel. (1980). “An Algorithm for Large Zero-One Knapsack Problems.” Operations Research 28(5), 1130–1153.
2. Bourgeois, Ph. and G. Plateau. (1992). “Selected Algorithmic Tools for the Resolution of the 0-1 Knapsack Problem.” EURO XII - TIMS XXXI Joint International Conference, Helsinki.
3. Camerini, P.M., L. Fratta, and F. Maffioli. (1975). “On Improving Relaxation Methods by Modified Gradient Techniques.” Mathematical Programming Study 3, 26–34.
4. Carstensen, P.J. (1983). “Complexity of Some Parametric Integer and Network Programming Problems.” Mathematical Programming 26, 64–75.
5. Chakravarti, N. and A.P.M. Wagelmans. (1999). “Calculation of Stability Radius for Combinatorial Optimization Problems.” Operations Research Letters 23, 1–7.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Determining the Number of Clusters using Neural Network and Max Stable Set Problem;Procedia Computer Science;2018
2. Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach;International Journal of Interactive Multimedia and Artificial Intelligence;2016
3. 0-1 Knapsack Problems;Paradigms of Combinatorial Optimization;2014-08-08
4. General Bibliography;Paradigms of Combinatorial Optimization;2014-08-08
5. 0-1 Knapsack Problems;Paradigms of Combinatorial Optimization;2013-02-13