The multiple subset sum problem

DOI10.1137/S1052623498348481MaRDI QIDQ2706330zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Alberto Caprara, Hans Kellerer, Ulrich Pferschy

Publication date 19 March 2001

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623498348481

zbMATH Keywords

knapsack problemapproximation schememultiple subset sum problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• A PTAS for the multiple subset sum problem with different knapsack capacities
• A 3/4-approximation algorithm for multiple subset sum
• scientific article; zbMATH DE number 1445306
• A Fast Approximation Scheme for the Multiple Knapsack Problem
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

Cited in

(25)

• Approximate core allocations and integrality gap for the bin packing game
• Lens Spaces, Isospectral on Forms but not on Functions
• Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
• The budgeted maximin share allocation problem
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Multiple subset sum with inclusive assignment set restrictions
• An approximation scheme for the two-stage, two-dimensional knapsack problem
• Approximation algorithms for scheduling with reservations
• Mathematical models and decomposition methods for the multiple knapsack problem
• A 3/4-approximation algorithm for multiple subset sum
• \(\kappa\)-partitioning problems for maximizing the minimum load
• Notes on inverse bin-packing problems
• A successive approximation algorithm for the multiple knapsack problem
• Coupled-tasks in presence of bipartite compatibilities graphs
• Lower and upper bounds for the non-linear generalized assignment problem
• Approximate composable truthful mechanism design
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• On the packing functions of some linear sets of Lebesgue measure zero
• Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time
• A PTAS for the multiple subset sum problem with different knapsack capacities
• Some complexity and approximation results for coupled-tasks scheduling problem according to topology
• Partitioning problems with splittings and interval targets
• Coordinated lab-clinics: a tactical assignment problem in healthcare
• A Fast Approximation Scheme for the Multiple Knapsack Problem
• Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem

This page was built for publication: The multiple subset sum problem

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