The subset sum problem

MaRDI QIDQ3095720zbMATH OpenFDO

Authors Petko Lalov, Stefan Dimitrov

Publication date 3 November 2011

zbMATH Keywords

complexity theorysubset sum problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• Subset-sum problems with different summands: Computation
• A Fast Approximation Algorithm for the Subset-sum Problem
• On variations of the subset sum problem
• A Fast Approximation Algorithm For The Subset-Sum Problem
• scientific article; zbMATH DE number 1104339

Cited in

(10)

• A competitive local search heuristic for the subset sum problem
• On variations of the subset sum problem
• On the best choice of a branching variable in the subset sum problem
• Subset sum problems with special digraph constraints
• Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering
• Dynamic programming for the subset sum problem
• The Subset Sum game
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• An exact algorithm for the subset sum problem
• Subset-sum problems with different summands: Computation

This page was built for publication: The subset sum problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095720)