Subset-sum problems with different summands: Computation

DOI10.1016/0166-218X(90)90071-JzbMath0709.90082OpenAlexW2032467110MaRDI QIDQ922292

Mark Chaimovich

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90071-j

zbMATH Keywords

subset-sum problem

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Unnamed Item ⋮ Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks ⋮ Estimating the cardinality of a difference subset of the discrete multi-torus \(\mathbb Z_3^n\)

Cites Work

• On two additive problems
• On sums of subsets of a set of integers
• On representation of r-th powers by subset sums
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subset-sum problems with different summands: Computation