An algorithm for algebraic assignment problems

DOI10.1016/0166-218X(79)90002-7MaRDI QIDQ1138479zbMATH OpenOpenAlexDBLPWikidataFDO

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

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

Cites work

• scientific article; zbMATH DE number 3217058 (Why is no real title available?)
• scientific article; zbMATH DE number 3338967 (Why is no real title available?)
• A general Hungarian method for the algebraic transportation problem
• An algebraic approach to assignment problems
• An augmenting path method for solving linear bottleneck assignment problems
• An augmenting path method for solving linear bottleneck transportation problems
• On some techniques useful for solution of transportation network problems
• Weakly admissible transformations for solving algebraic assignment and transportation problems

Cited in

(2)

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

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

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