Author:
Andonov R.,Poirriez V.,Rajopadhye S.
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference17 articles.
1. R. Andonov, V. Poirriez, S. Rajopadhye, Unbounded knapsack problem: Dynamic programming revisited, Internal Report 1152, IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France, 1997. This report superseeds RR-96-07, October 1996, LIMAV, Université de Valenciennes (Efficient Dynamic Programming for the Unbouded Knapsack Problem)
2. R. Andonov, S. Rajopadhye, A sparse knapsack algo-tech-cuit and its synthesis, in: P. Cappello, R. Owens, E. Swartzlander, B. Wah (Eds.), International Conference on Application Specific Array Processors ASAP'94, IEEE 1994, San Francisco, CA, pp. 302–313
3. A new knapsack solution approach by integer equivalent aggregation and consistency determination;Babaev;INFORM Journal on Computing,1997
4. Reducing the number of variables in integer and linear programming problems;Babaev;Computational Optimization and Applications,1994
5. A note on dominance relation in unbounded knapsack problem;Dudzinski;Operations Research Letters,1991
Cited by
94 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献