A sequential dual simplex algorithm for the linear assignment problem

DOI10.1016/0167-6377(88)90082-XMaRDI QIDQ1108928zbMATH OpenFDO

Authors 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)

Recommendations

• Efficient dual simplex algorithms for the assignment problem
• On dual solutions of the linear assignment problem
• A competitive (dual) simplex method for the assignment problem
• A simple dual algorithm for the generalised assignment problem
• A Dual Simplex Algorithm for Piecewise-Linear Programming
• scientific article; zbMATH DE number 56167
• A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming
• scientific article; zbMATH DE number 3922378
• A dual version of Tardos's algorithm for linear programming
• scientific article; zbMATH DE number 515938

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• A competitive (dual) simplex method for the assignment problem
• A network simplex method
• Efficient dual simplex algorithms for the assignment problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Signature Methods for the Assignment Problem
• The alternating basis algorithm for assignment problems

Cited in

(17)

• The computational efficiency of Ji-Lee-Li algorithm for the assignment problem
• Efficient dual simplex algorithms for the assignment problem
• scientific article; zbMATH DE number 176471 (Why is no real title available?)
• scientific article; zbMATH DE number 3982944 (Why is no real title available?)
• A simple dual algorithm for the generalised assignment problem
• A competitive (dual) simplex method for the assignment problem
• A genuinely polynomial primal simplex algorithm for the assignment problem
• A primal-dual simplex method for linear programs
• On dual solutions of the linear assignment problem
• scientific article; zbMATH DE number 4066629 (Why is no real title available?)
• Algorithms and codes for dense assignment problems: The state of the art
• A strongly polynomial simplex method for the linear fractional assignment problem
• A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
• scientific article; zbMATH DE number 17627 (Why is no real title available?)
• scientific article; zbMATH DE number 1795712 (Why is no real title available?)
• On the initialization methods of an exterior point algorithm for the assignment problem
• scientific article; zbMATH DE number 3922378 (Why is no real title available?)

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

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