Open AccessPosted Content
The binary knapsack problem: solutions with guaranteed quality
Diptesh Ghosh,Boris Goldengorin +1 more
TL;DR: This paper embed heuristics within a branch and bound framework to produce an algorithm that generates solutions with guaranteed quality within very short times for binary knapsack problems.
read more
Abstract: Binary knapsack problems are some of the most widely studied problems in combinatorial optimization. Several algorithms, both exact and approximate are known for this problem. In this paper, we embed heuristics within a branch and bound framework to produce an algorithm that generates solutions with guaranteed quality within very short times. We report computational experiments that show that for the more difficult strongly correlated problems, our algorithm can generate solutions within 0.01% of the optimal solution in less than 10% of the time required by exact algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Nature-Inspired Algorithms and Applied Optimization
Xin-She Yang
- 01 Jan 2018
TL;DR: This work intends to analyze nature-inspired algorithms both qualitatively and quantitatively, and briefly outline the links between self-organization and algorithms, and then analyze algorithms using Markov chain theory, dynamic system and other methods.
204
Applications of Flower Pollination Algorithm in Feature Selection and Knapsack Problems
Hossam M. Zawbaa,Eid Emary +1 more
- 01 Jan 2018
TL;DR: This chapter presents one of the recently proposed bio-inspired optimization methods, namely, flower pollination algorithm (FPA), which was benchmarked against bat algorithm, genetic algorithm, particle swarm optimization (PSO), and is found to be very competitive.
14
Efficient task replication and management for adaptive fault tolerance in mobile Grid environments
TL;DR: An efficient scheme based on task replication, which utilizes the Weibull reliability function for the grid resources so as to estimate the number of replicas that are going to be scheduled in order to guarantee a specific fault tolerance level for the Grid environment is presented.
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
•Book
Knapsack Problems: Algorithms and Computer Implementations
Silvano Martello,Paolo Toth +1 more
- 01 Nov 1990
TL;DR: This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.
4K
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
TL;DR: A combination of two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem, where, in additi on, valid inequalities are generated and surrogate relaxed, and a new initial core problem is adopted.
443