Coupled and \(k\)-sided placements: generalizing generalized assignment

DOI10.1007/s10107-015-0930-1zbMath1333.90071OpenAlexW2179076272MaRDI QIDQ896299

Rajmohan Rajaraman, Madhukar R. Korupolu, Adam Meyerson, Brian Tagiku

Publication date: 9 December 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-015-0930-1

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

Reallocation problems with minimum completion time ⋮ Robustly assigning unstable items

Cites Work

• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• An approximation algorithm for the generalized assignment problem
• On the complexity of approximating \(k\)-set packing
• Iterative Methods in Combinatorial Optimization
• On k-Column Sparse Packing Programs
• Convex programming for scheduling unrelated parallel machines
• Tight approximation algorithms for maximum general assignment problems
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• The Moser--Tardos Framework with Partial Resampling
• Constraint satisfaction, packet routing, and the lovasz local lemma
• How to Sell Hyperedges: The Hypermatching Assignment Problem