A dual feasible forest algorithm for the linear assignment problem

DOI10.1051/RO/1991250404031MaRDI QIDQ3991697zbMATH OpenOpenAlexFDO

Authors

Publication date 28 June 1992

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105022

zbMATH Keywords

assignmentaverage behaviordual feasible forest algorithmdual simplex methodpivotingsignaturesstrongly feasible tree

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80) Linear programming (90C05) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 17627
• A sequential dual simplex algorithm for the linear assignment problem
• scientific article; zbMATH DE number 176471

Cited in

(9)

• Solving linear bottleneck assignment problems via strong spanning trees
• An algorithm for fractional assignment problems
• Efficient dual simplex algorithms for the assignment problem
• Remarks on implementation of O ( n ^1/2 τ) assignment algorithms
• 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 176471 (Why is no real title available?)
• scientific article; zbMATH DE number 1795712 (Why is no real title available?)
• A genuinely polynomial primal simplex algorithm for the assignment problem

This page was built for publication: A dual feasible forest 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 Q3991697)