A sequential dual simplex algorithm for the linear assignment problem

DOI10.1016/0167-6377(88)90082-XzbMath0654.90053MaRDI QIDQ1108928

Mustafa Akgül

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

linear assignment problemtransshipmentdual simplex methoddirected bipartite graphdual strongly feasible trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (4)

On the initialization methods of an exterior point algorithm for the assignment problem ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ A genuinely polynomial primal simplex algorithm for the assignment problem ⋮ A primal-dual simplex method for linear programs

Cites Work

• Unnamed Item
• Efficient dual simplex algorithms for the assignment problem
• Signature Methods for the Assignment Problem
• A competitive (dual) simplex method for the assignment problem
• A network simplex method
• The alternating basis algorithm for assignment problems
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: A sequential dual simplex algorithm for the linear assignment problem