A dual feasible forest algorithm for the linear assignment problem

DOI10.1051/ro/1991250404031zbMath0744.90088OpenAlexW2495273209MaRDI QIDQ3991697

No author found.

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

assignmentsignaturespivotingdual simplex methodaverage behaviordual feasible forest algorithmstrongly feasible tree

Mathematics Subject Classification ID

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

Related Items (1)

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