scientific article; zbMATH DE number 3982944

MaRDI QIDQ3748087zbMATH OpenFDO

Authors Katarina Cechlárová

Publication date 1986

zbMATH Keywords

algebraic assignment problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming in abstract spaces (90C48)

Recommendations

• Efficient dual simplex algorithms for the assignment problem
• scientific article; zbMATH DE number 176471
• A sequential dual simplex algorithm for the linear assignment problem
• Selected topics on assignment problems
• An algorithm for ranking assignments using reoptimization

Cited in

(8)

• Strong linear independence in bottleneck algebra
• A note on a new variant of Murty's ranking assignments algorithm
• Trapezoidal matrices and the bottleneck assignment problem
• The dominance assignment problem
• An algorithm for ranking assignments using reoptimization
• scientific article; zbMATH DE number 4081306 (Why is no real title available?)
• scientific article; zbMATH DE number 1900918 (Why is no real title available?)
• scientific article; zbMATH DE number 2118621 (Why is no real title available?)

This page was built for publication:

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