Maximum Generalized Assignment with Convex Costs

DOI10.1007/978-3-319-09174-7_7zbMATH Open1452.90200OpenAlexW2098381303MaRDI QIDQ3195318

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

complexitygeneralized assignment problemcombinatorial optimizationapproximation algorithms

Mathematics Subject Classification ID

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

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)