An efficient algorithm for a class of generalized assignment problem

MaRDI QIDQ3609290zbMATH OpenFDO

Authors Yingzi Yu, Qiang Zhang

Publication date 6 March 2009

zbMATH Keywords

assignment problemdegenerateHungarian methodtransform

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Multi-objective and goal programming (90C29)

Recommendations

• scientific article; zbMATH DE number 3918100
• A network flow algorithm for solving generalized assignment problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• scientific article; zbMATH DE number 841607

Cited in

(13)

• An approximation algorithm for the generalized assignment problem
• A simple dual algorithm for the generalised assignment problem
• A note on exact algorithms for the bottleneck generalized assignment problem
• A new extended formulation of the generalized assignment problem and some associated valid inequalities
• An efficient algorithm for the symmetric principal minor assignment problem
• A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
• A path relinking approach with ejection chains for the generalized assignment problem
• A reverse point algorithm for the assignment problem of the assignment of jobs with less number persons than jobs
• A hybrid algorithm for the generalized assignment problem
• A model and an algorithm for the task assignment problem in product data management
• scientific article; zbMATH DE number 3918100 (Why is no real title available?)
• Reducing the elastic generalized assignment problem to the standard generalized assignment problem
• Sinkhorn Algorithm for Lifted Assignment Problems

This page was built for publication: An efficient algorithm for a class of generalized assignment problem

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