The Multiple Subset Sum Problem
From MaRDI portal
Publication:2706330
DOI10.1137/S1052623498348481zbMath1010.90070OpenAlexW1975503278WikidataQ56050299 ScholiaQ56050299MaRDI QIDQ2706330
Hans Kellerer, Ulrich Pferschy, Alberto Caprara
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
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (19)
Approximate core allocations and integrality gap for the bin packing game ⋮ \(\kappa\)-partitioning problems for maximizing the minimum load ⋮ A Fast Approximation Scheme for the Multiple Knapsack Problem ⋮ Multiple subset sum with inclusive assignment set restrictions ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Approximate composable truthful mechanism design ⋮ Coupled-Tasks in Presence of Bipartite Compatibilities Graphs ⋮ Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem ⋮ Lower and upper bounds for the non-linear generalized assignment problem ⋮ Some complexity and approximation results for coupled-tasks scheduling problem according to topology ⋮ Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms ⋮ Coordinated lab-clinics: a tactical assignment problem in healthcare ⋮ An approximation scheme for the two-stage, two-dimensional knapsack problem ⋮ Notes on inverse bin-packing problems ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Approximation algorithms for scheduling with reservations ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability ⋮ A successive approximation algorithm for the multiple knapsack problem ⋮ Lens Spaces, Isospectral on Forms but not on Functions
This page was built for publication: The Multiple Subset Sum Problem
