Reducing the elastic generalized assignment problem to the standard generalized assignment problem

DOI10.1057/JORS.2009.108zbMATH Open1230.90125OpenAlexW2040398045MaRDI QIDQ4933641FDOQ4933641

Authors M. Büther

Publication date 14 October 2010

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10419/147551

zbMATH Keywords

combinatorial optimizationassignmentmixed integer programmingcapacity planningbinary representation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• The elastic generalized assignment problem
• An efficient approximation for the generalized assignment problem
• The generalized assignment problem
• scientific article; zbMATH DE number 3918100
• A reduction approach to the repeated assignment problem
• An approximation algorithm for the generalized assignment problem
• Solving the generalised assignment problem using polyhedral results
• A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
• An efficient algorithm for a class of generalized assignment problem
• Solution of a class of generalized assignment problem

Cited in

(1)

• The elastic generalized assignment problem

This page was built for publication: Reducing the elastic generalized assignment problem to the standard generalized assignment problem

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