Maximum generalized assignment with convex costs

DOI10.1007/978-3-319-09174-7_7MaRDI QIDQ3195318zbMATH OpenOpenAlexFDO

Authors Marco Bender, Stephan Westphal

Publication date 16 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09174-7_7

zbMATH Keywords

approximation algorithmscombinatorial optimizationcomplexitygeneralized assignment problem

Mathematics Subject Classification ID

Approximation algorithms (68W25) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
• An efficient approximation for the generalized assignment problem
• Tight approximation algorithms for maximum separable assignment problems
• The generalized assignment problem with minimum quantities
• A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items

Cited in

(3)

• A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items
• Packing under convex quadratic constraints
• Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems

This page was built for publication: Maximum generalized assignment with convex costs

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