Tight bounds for periodicity theorems on the unbounded Knapsack problem-Reference-Cited by-同舟云学术

Tight bounds for periodicity theorems on the unbounded Knapsack problem

Published:2011-12 Issue:2 Volume:215 Page:319-324
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Huang Ping H.,Lawley Mark,Morin Thomas

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference19 articles.

1. Unbounded Knapsack problem: dynamic programming revisited;Andonov;European Journal of Operational Research,2000

2. Computational aspects of hard Knapsack problems;Caccetta;Nonlinear Analysis,2001

3. Computers and Intractability: A Guide to the Theory of NP Completeness;Garey,1990

4. Integer Programming;Garfinkel,1972

5. The theory and computation of Knapsack functions;Gilmore;Operations Research,1966

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Knapsack problems — An overview of recent advances. Part I: Single knapsack problems;Computers & Operations Research;2022-07

2. Research on the Problem of Circular Blank Based on Shear Cutting;Proceedings of the 2022 2nd International Conference on Control and Intelligent Robotics;2022-06-24

3. Research on optimization technology based on two-dimensional packing;Journal of Physics: Conference Series;2022-01-01

4. Price and cold-chain service decisions versus integration in a fresh agri-product supply chain with competing retailers;Annals of Operations Research;2019-09-23

5. Decision-making of fresh agricultural product supply chain considering the manufacturer’s fairness concerns;4OR;2019-05-18