A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
From MaRDI portal
Recommendations
- An exact algorithm for the subset sum problem
- scientific article; zbMATH DE number 176777
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
- An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
- Techniques for solving subset sum problems within a given tolerance
- Two linear approximation algorithms for the subset-sum problem
- The subset sum problem
- Solving dense subset-sum problems by using analytical number theory
- A competitive local search heuristic for the subset sum problem
- On the best choice of a branching variable in the subset sum problem
Cited in
(23)- A hybrid algorithm for the unbounded knapsack problem
- Approximation schemes for the subset-sum problem: Survey and experimental analysis
- Solving dense subset-sum problems by using analytical number theory
- A competitive local search heuristic for the subset sum problem
- A branch bound method for subset sum problem
- A polynomial approximation scheme for the subset sum problem
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Coordinated lab-clinics: a tactical assignment problem in healthcare
- On the best choice of a branching variable in the subset sum problem
- Efficient reformulation for 0-1 programs -- methods and computational results
- An efficient pruning algorithm for value independent knapsack problem using a DAG structure
- Two linear approximation algorithms for the subset-sum problem
- Bridging game theory and the knapsack problem: a theoretical formulation
- Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering
- Start Strategies of ACO Applied on Subset Problems
- Sensitivity analysis of ACO start strategies for subset problems
- An exact decomposition algorithm for the generalized knapsack sharing problem
- Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
- Comparison of different ACO start strategies based on InterCriteria analysis
- A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
- An exact algorithm for the subset sum problem
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- Subset-sum problems with different summands: Computation
This page was built for publication: A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220352)
