An algebraic approach to assignment problems
From MaRDI portal
Publication:4135225
DOI10.1007/BF01593800zbMATH Open0361.90047OpenAlexW2025806871MaRDI QIDQ4135225FDOQ4135225
Authors: Rainer E. Burkard, W. Hahn, 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
Cites Work
Cited In (20)
- Discrete optimization: an Austrian view
- On scheduling multi-processor systems with algebraic objectives
- Selected topics on assignment problems
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
- Trapezoidal matrices and the bottleneck assignment problem
- Bottleneck capacity expansion problems with general budget constraints
- Random assignment problems
- Optimal cocircuits in regular matroids and applications
- Reducibility of minimax to minisum 0-1 programming problems
- An improved general procedure for lexicographic bottleneck problems
- OR Utopia
- An out-of-kilter method for the algebraic circulation problem
- A genuinely polynomial primal simplex algorithm for the assignment problem
- An algorithm for algebraic assignment problems
- Duality for algebraic linear programming
- A general Hungarian method for the algebraic transportation problem
- Duality and admissible transformations in combinatorial optimization
- An augmenting path method for solving linear bottleneck assignment problems
- Universal conditions for algebraic travelling salesman problems to be efficiently solvable
- Numerical investigations on quadratic assignment problems
This page was built for publication: An algebraic approach to assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4135225)
