The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Algorithms for polynomial factorization.
Algorithms for polynomial factorization.
A model to order the encryption algorithms according to their quality
ACM SIGCOMM Computer Communication Review
A common schema for dynamic programming and branch and bound algorithms
Journal of the ACM (JACM)
A Parallel Time/Hardware Tradeoff T.H=O(2/sup n/2/) for the Knapsack Problem
IEEE Transactions on Computers
Reducing the frequency of tag compares for low power I-cache design
ISLPED '95 Proceedings of the 1995 international symposium on Low power design
Asynchronous Analysis of Parallel Dynamic Programming Algorithms
IEEE Transactions on Parallel and Distributed Systems
A parallel two-list algorithm for the knapsack problem
Parallel Computing
Taking the work out of simulation modeling: an application of technology integration
Proceedings of the 29th conference on Winter simulation
Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem
Computational Optimization and Applications
When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
A Direct Descent Binary Knapsack Algorithm
Journal of the ACM (JACM)
Random Trees and the Analysis of Branch and Bound Procedures
Journal of the ACM (JACM)
ACM Transactions on Mathematical Software (TOMS)
Symmetric and Asymmetric Encryption
ACM Computing Surveys (CSUR)
SIGIR '79 Proceedings of the 2nd annual international ACM SIGIR conference on Information storage and retrieval: information implications into the eighties
Performance Optimization Problem in Speculative Prefetching
IEEE Transactions on Parallel and Distributed Systems
Comments on parallel algorithms for the knapsack problem
Parallel Computing
An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Random knapsack in expected polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the cryptocomplexity of knapsack systems
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The complexity of design automation problems
DAC '80 Proceedings of the 17th Design Automation Conference
An algorithm for selection of migration candidates
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Probabilistic analysis of knapsack core algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Random knapsack in expected polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
An efficient parallel algorithm for solving the Knapsack problem on hypercubes
Journal of Parallel and Distributed Computing
An exact algorithm for the knapsack sharing problem
Computers and Operations Research
Journal of Parallel and Distributed Computing
Optimal parallel algorithm for the knapsack problem without memory conflicts
Journal of Computer Science and Technology
Approximation Algorithms for Multiconstrained Quality-of-Service Routing
IEEE Transactions on Computers
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
An optimization model for web content adaptation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Faà di Bruno's formula, lattices, and partitions
Discrete Applied Mathematics
Journal of Management Information Systems
Approximation schemes for a class of subset selection problems
Theoretical Computer Science
A Parallel Algorithm for the Knapsack Problem
IEEE Transactions on Computers
Maximum utilization of vehicle capacity: A case of MRO items
Computers and Industrial Engineering
Open problems around exact algorithms
Discrete Applied Mathematics
An optimal parallelization of the two-list algorithm of cost O(2n/2)
Parallel Computing
On the Exact Separation of Mixed Integer Knapsack Cuts
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Parallel time and space upper-bounds for the subset-sum problem
Theoretical Computer Science
Sort and Search: Exact algorithms for generalized domination
Information Processing Letters
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Auctioning Vertically Integrated Online Services: Computational Approaches for Real-Time Allocation
Journal of Management Information Systems
An optimization model for Web content adaptation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Note: Faá di Bruno's formula, lattices, and partitions
Discrete Applied Mathematics
Note: On exponential time lower bound of Knapsack under backtracking
Theoretical Computer Science
Saving space by algebraization
Proceedings of the forty-second ACM symposium on Theory of computing
Integer linear programming model for multidimensional two-way number partitioning problem
Computers & Mathematics with Applications
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
Computers and Operations Research
A parallel O(n27n/8) time-memory-processor tradeoff for Knapsack-like problems
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
New generic algorithms for hard knapsacks
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
A hybrid recursive multi-way number partitioning algorithm
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Openflow random host mutation: transparent moving target defense using software defined networking
Proceedings of the first workshop on Hot topics in software defined networks
On the optimal allocation of adversarial resources
Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking
Parallel solution of the subset-sum problem: an empirical study
Concurrency and Computation: Practice & Experience
Homomorphic hashing for sparse coefficient extraction
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
A note on developing optimal and scalable parallel two-list algorithms
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Inductive complexity of p versus NP problem
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
On the connection between Hamming codes, Heapsort and other methods
Information Processing Letters
Space---Time tradeoffs for subset sum: an improved worst case algorithm
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Bounding the running time of algorithms for scheduling and packing problems
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Proceedings of Programming Models and Applications on Multicores and Manycores
On an extension of the Sort & Search method with application to scheduling theory
Theoretical Computer Science
Outsourcing computation of modular exponentiations in cloud computing
Cluster Computing
Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
Computers and Operations Research
Hi-index | 0.02 |
Given r numbers s1, ···, sr, algorithms are investigated for finding all possible combinations of these numbers which sum to M. This problem is a particular instance of the 0-1 unidimensional knapsack problem. All of the usual algorithms for this problem are investigated in terms of both asymptotic computing times and storage requirements, as well as average computing times. We develop a technique which improves all of the dynamic programming methods by a square root factor. Empirical studies indicate this new algorithm to be generally superior to all previously known algorithms. We then show how this improvement can be incorporated into the more general 0-1 knapsack problem obtaining a square root improvement in the asymptotic behavior. A new branch and search algorithm that is significantly faster than the Greenberg and Hegerich algorithm is also presented. The results of extensive empirical studies comparing these knapsack algorithms are given