A 3/4-approximation algorithm for multiple subset sum

DOI10.1023/A:1022584312032zbMath1035.90068OpenAlexW1514421714MaRDI QIDQ1402509

Hans Kellerer, Alberto Caprara, Ulrich Pferschy

Publication date: 28 August 2003

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022584312032

zbMATH Keywords

approximation algorithm3-partitioningmultiple subset sum

Mathematics Subject Classification ID

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

Related Items (14)

Approximate core allocations and integrality gap for the bin packing game ⋮ Multiple subset sum with inclusive assignment set restrictions ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Coupled-Tasks in Presence of Bipartite Compatibilities Graphs ⋮ Some complexity and approximation results for coupled-tasks scheduling problem according to topology ⋮ Faster algorithms for \(k\)-\textsc{Subset Sum} and variations ⋮ Coordinated lab-clinics: a tactical assignment problem in healthcare ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Integrality gap analysis for bin packing games ⋮ A branch-and-bound algorithm for hard multiple knapsack problems ⋮ 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 ⋮ Faster algorithms for \(k\)-subset sum and variations

This page was built for publication: A 3/4-approximation algorithm for multiple subset sum