Sums of lexicographically ordered sets

DOI10.1016/0012-365X(90)90112-UzbMath0698.90059MaRDI QIDQ912760

Nicola Santoro, Alberto Negro, Michael D. Atkinson

Publication date: 1990

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

zbMATH Keywords

knapsack problemlinear solvability

Mathematics Subject Classification ID

Boolean programming (90C09) Enumerative combinatorics (05A99) Special sequences and polynomials (11B83)

Related Items (3)

Convex hulls of superincreasing knapsacks and lexicographic orderings ⋮ Bigger and better subset‐sum‐distinct sets ⋮ Integer Sets with Distinct Subset-Sums

Cites Work

• Integer Sets with Distinct Subset-Sums
• Sets of Integers Whose Subsets Have Distinct Sums
• Hiding information and signatures in trapdoor knapsacks
• Unsolved problems in number theory

This page was built for publication: Sums of lexicographically ordered sets