Coupled and k-sided placements: generalizing generalized assignment
DOI10.1007/S10107-015-0930-1zbMATH Open1333.90071OpenAlexW2179076272MaRDI QIDQ896299FDOQ896299
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
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- An approximation algorithm for the generalized assignment problem
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Approximation algorithms for scheduling unrelated parallel machines
- On the complexity of approximating \(k\)-set packing
- Iterative Methods in Combinatorial Optimization
- Convex programming for scheduling unrelated parallel machines
- Tight approximation algorithms for maximum general assignment problems
- Title not available (Why is that?)
- On k-Column Sparse Packing Programs
- The Moser--Tardos Framework with Partial Resampling
- Constraint satisfaction, packet routing, and the lovasz local lemma
- How to Sell Hyperedges: The Hypermatching Assignment Problem
Cited In (3)
This page was built for publication: Coupled and \(k\)-sided placements: generalizing generalized assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896299)
