Algorithms for Knapsack Problems
References (81)
- et al.
A Note on the Martello-Toth Algorithm for One-Dimensional Knapsack Problems
European Journal of Operational Research
(1985) Approximation Schemes for Combinational Problems
Journal of Computer and System Science
(1974)- et al.
A Fully Polynomial Approximate Algorithm for the 0-1 Knapsack Problem
European Journal of Operational Research
(1981) - et al.
An Upper Bound for the Zero-One Knapsack Problem and a Branch and Bound Algorithm
European Journal of Operational Research
(1977) - et al.
Solution of the Zero-One Multiple Knapsack Problem
European Journal of Operational Research
(1980) - et al.
Optimal and Canonical Solutions of the Change-Making Problem
European Journal of Operational Research
(1980) - et al.
A Bound and Bound Algorithm for the Zero-One Multiple Knapsack Problem
Discrete Applied Mathematics
(1981) An Algorithm and Efficient Data Structures for the Binary Knapsack Problem
European Journal of Operational Research
(1978)- et al.
Data Structures and Algorithms
(1983) - et al.
Merging and Sorting Applied to the Zero-One Knapsack Problem
Operations Research
(1975)
Linear Functions on the N-dimensional Unit Cube
Doklady Akademiia Nauk SSSR
(1975)
An Algorithm for Large Zero-One Knapsack Problems
Operations Research
(1980)
A Linked List Data Structure for a Binary Knapsack Algorithm
Research Report CCS
(1975)
Applied Dynamic Programming
(1962)
An Enumeration Algorithm for Knapsack Problems
Operations Research
(1970)
Algorithmic Solution of the Change-Making Problem
Journal of ACM
(1970)
Algorithm 397. An Integer Programming Problem
Communications of ACM
(1970)
Canonical Coin-Changing and Greedy Solutions,
Journal of ACM
(1976)
Hard Knapsack Problems
Operations Research
(1980)
A Method for Allocating Funds to Investment Projects when Returns are Subject to Uncertainty,
Management Science
(1964)
Discrete Variable Extremum Problems
Operations Research
(1957)
A Reduction Algorithm for Knapsack Problems,
Methods of Operations Research
(1980)
Solution of the Value-Independent Knapsack Problem by Partitioning,
Operations Research
(1973)
Resolution of the 0-1 Knapsack Problem: Comparison of Methods
Mathematical Programming
(1975)
An Algorithm for the Solution of the 0-1 Knapsack Problem
Computing
(1982)
A Heuristic Routine for Solving Large Loading Problems
Naval Research Logistics Quarterly
(1979)
Computers and Intractability:a Guide to the Theory of NP-Completeness
(1979)
Integer Programming
(1972)
Fast Approximation Algorithms for Knapsack Type Problems
A Linear Programming Approach to the Cutting Stock Problem I
Operations Research
(1961)
A Linear Programming Approach to the Cutting Stock Problem II
Operations Research
(1963)
Multi-Stage Cutting Stock Problems of Two and More Dimensions
Operations Research
(1965)
The Theory and Computation of Knapsack Functions
Operations Research
(1966)
A Branch Search Algorithm for the Knapsack Problem
Management Science
(1970)
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
Journal of ACM
(1976)
Computing Partitions with Applications to the Knapsack Problem
Journal of ACM
(1974)
Integer Programming and Network Flows
(1969)
Cited by (44)
Towards scalable and efficient Deep-RL in edge computing: A game-based partition approach
2022, Journal of Parallel and Distributed ComputingCitation Excerpt :First, this problem is apparently in NP as any solution to its decision form can be validated in polynomial time. Then, we conduct a reduction from MADP to the classical NP-complete knapsack problem (KP) [19,26] in polynomial time, to show the hardness of MADP. For the reduction purposes, we transform the original minimization of MADP into an equivalent maximization goal.
The orienteering problem: A hybrid control Formulation
2021, IFAC-PapersOnLineRe-Max: A Reward Maximization Approach for Heterogeneous Drone Scheduling Problem
2024, ACM International Conference Proceeding SeriesImproved Task Allocation in Mobile Crowd Sensing Based on Mobility Prediction and Multi-objective Optimization
2024, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Handling Sub-symmetry in Integer Programming using Activation Handlers
2024, AIRO Springer Series
Copyright © 1987 Published by Elsevier B.V.