An algebraic approach to assignment problems

DOI10.1007/BF01593800zbMath0361.90047OpenAlexW2025806871MaRDI QIDQ4135225

W. Hahn, Rainer E. Burkard, Uwe T. Zimmermann

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01593800

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (20)

A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective ⋮ An algorithm for algebraic assignment problems ⋮ Duality for algebraic linear programming ⋮ Reducibility of minimax to minisum 0-1 programming problems ⋮ Optimal cocircuits in regular matroids and applications ⋮ Random assignment problems ⋮ A genuinely polynomial primal simplex algorithm for the assignment problem ⋮ Discrete optimization: an Austrian view ⋮ Selected topics on assignment problems ⋮ Bottleneck Capacity Expansion Problems with General Budget Constraints ⋮ Duality and admissible transformations in combinatorial optimization ⋮ Universal conditions for algebraic travelling salesman problems to be efficiently solvable ⋮ An augmenting path method for solving linear bottleneck assignment problems ⋮ A general Hungarian method for the algebraic transportation problem ⋮ Numerical investigations on quadratic assignment problems ⋮ Trapezoidal matrices and the bottleneck assignment problem ⋮ On scheduling multi-processor systems with algebraic objectives ⋮ OR Utopia ⋮ An out-of-kilter method for the algebraic circulation problem ⋮ An improved general procedure for lexicographic bottleneck problems

Cites Work

• Unnamed Item
• An equivalency problem in discrete programming over ordered semigroups
• Lexicographical problems of linear programming

This page was built for publication: An algebraic approach to assignment problems