On variations of the subset sum problem

DOI10.1016/S0166-218X(96)00105-9zbMath0895.90159MaRDI QIDQ1382248

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

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

Related Items (7)

Weighted proper orientations of trees and graphs of bounded treewidth ⋮ Convex hulls of superincreasing knapsacks and lexicographic orderings ⋮ Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions ⋮ Unbounded knapsack problems with arithmetic weight sequences ⋮ NP-completeness for calculating power indices of weighted majority games ⋮ On the complexity of computing Gröbner bases for weighted homogeneous systems ⋮ Counting the decimation classes of binary vectors with relatively prime length and density

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing integer knapsacks for feasibility
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• Integer Programming with a Fixed Number of Variables
• The cutting stock problem and integer rounding
• When the Greedy Solution Solves a Class of Knapsack Problems
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

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