Author:
Hansen Paul,Ryan Jennifer
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference8 articles.
1. Babayev D., Glover F., and Ryan, J., “Solving integer knapsack problems by integer equivalent aggregation and consistency testing”, Peprint.
2. Dynamic Programming;Bellman,1957
3. On a problem of partitions;Brauer;American Journal of Mathematics,1942
4. Shortest route methods: 2. Group knapsacks, expanded networks and branch and bound;Denardo;Operations Research,1979
5. Integer programming over a finite additive group;Glover;SIAM Journal on Control,1969
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On the Variants of Subset Sum: Projected and Unbounded;2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2023-09-11
2. Integer Programming Formulations For The Frobenius Problem;International Journal of Pure Mathematics;2021-12-28
3. Tolerance analysis for 0–1 knapsack problems;European Journal of Operational Research;2017-05
4. LLL-reduction for integer knapsacks;Journal of Combinatorial Optimization;2011-09-03
5. Expected Frobenius numbers;Journal of Combinatorial Theory, Series A;2011-02