A network flow algorithm for solving generalized assignment problem

DOI10.1155/2021/5803092MaRDI QIDQ6483803zbMATH OpenFDO

Authors Yongwen Hu, Qunpo Liu

Publication date 17 May 2021

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2021/5803092

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Recommendations

• The generalized assignment problem
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Solving the generalized assignment problem: an optimizing and heuristic approach
• A survey of algorithms for the generalized assignment problem

Cited in

(8)

• New algorithms for generalized network flows
• Network simplex algorithm for the general equal flow problem.
• An efficient algorithm for a class of generalized assignment problem
• A new algorithm for general matching problems using network flow subproblems
• scientific article; zbMATH DE number 1239857 (Why is no real title available?)
• A generalization of the assignment problem, and its application to the rank aggregation problem
• scientific article; zbMATH DE number 2227390 (Why is no real title available?)
• (Pareto)-optimization and greedy algorithm-based solutions for review and panel assignments

This page was built for publication: A network flow algorithm for solving generalized assignment problem

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