On variations of the subset sum problem
type: Item
instance of: scholarly article
title: On variations of the subset sum problem
zbMATH Open document ID: 0895.90159
DOI: 10.1016/S0166-218X(96)00105-9
published in: Discrete Applied Mathematics
publication date: 1998-03-25T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1133147
zbMATH Keywords: subset sum problem
author: Jorge Luis Ramírez Alfonsín
MaRDI profile type: Publication
cites work: Q4198056
cites work: Testing integer knapsacks for feasibility
cites work: A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
cites work: Integer Programming with a Fixed Number of Variables
cites work: When the Greedy Solution Solves a Class of Knapsack Problems
cites work: The cutting stock problem and integer rounding
cites work: Q3993418
cites work: Q4739657
cites work: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
description: scientific article; zbMATH DE number 1133147