An algorithm for algebraic assignment problems

DOI10.1016/0166-218X(79)90002-7zbMath0431.90051OpenAlexW1964058270WikidataQ57401649 ScholiaQ57401649MaRDI QIDQ1138479

Alan M. Frieze

Publication date: 1979

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(79)90002-7

zbMATH Keywords

polynomial algorithmalgebraic approach to assignment problemsalgebraic assignment problemsgeneral linear assignment problemtotally ordered commutative semigroup

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Programming in abstract spaces (90C48)

Related Items (2)

An out-of-kilter method for the algebraic circulation problem ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• An augmenting path method for solving linear bottleneck assignment problems
• A general Hungarian method for the algebraic transportation problem
• An augmenting path method for solving linear bottleneck transportation problems
• Weakly admissible transformations for solving algebraic assignment and transportation problems
• An algebraic approach to assignment problems
• On some techniques useful for solution of transportation network problems
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for algebraic assignment problems