On variations of the subset sum problem

DOI10.1016/S0166-218X(96)00105-9MaRDI QIDQ1382248zbMATH OpenFDO

Authors Jorge Luis Ramírez Alfonsín

Publication date 25 March 1998

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

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

subset sum problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Subset-sum problems with different summands: Computation
• The subset sum problem
• scientific article; zbMATH DE number 4149895
• On the complexity of variations of equal sum subsets
• scientific article; zbMATH DE number 176777

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Integer Programming with a Fixed Number of Variables
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• Testing integer knapsacks for feasibility
• The cutting stock problem and integer rounding
• When the Greedy Solution Solves a Class of Knapsack Problems

Cited in

(18)

• scientific article; zbMATH DE number 7688183 (Why is no real title available?)
• scientific article; zbMATH DE number 5115917 (Why is no real title available?)
• A short note on Merlin-Arthur protocols for subset sum
• Subset-sum problems with different summands: Computation
• Counting the decimation classes of binary vectors with relatively prime length and density
• Unbounded knapsack problems with arithmetic weight sequences
• Generalization of the subset sum problem and cubic forms
• Algebraic algorithms for variants of subset sum
• Subset sum problems with special digraph constraints
• New analytical results in subset-sum problem
• Remarks on 0-1 optimization problems with superincreasing and superdecreasing objective functions
• Dynamic programming for the subset sum problem
• NP-completeness for calculating power indices of weighted majority games
• Convex hulls of superincreasing knapsacks and lexicographic orderings
• The subset sum problem
• Solutions for subset sum problems with special digraph constraints
• Weighted proper orientations of trees and graphs of bounded treewidth
• On the complexity of computing Gröbner bases for weighted homogeneous systems

This page was built for publication: On variations of the subset sum problem

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