Trapezoidal matrices and the bottleneck assignment problem
From MaRDI portal
Publication:1805450
DOI10.1016/0166-218X(93)E0122-FzbMath0833.90076MaRDI QIDQ1805450
Publication date: 17 May 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
The general trapezoidal algorithm for strongly regular max--min matrices. ⋮ Bottleneck flows in unit capacity networks
Cites Work
- Unnamed Item
- On the regularity of matrices in min algebra
- Strong linear independence in bottleneck algebra
- The uniquely solvable bipartite matching problem
- Strong regularity of matrices -- a survey of results
- Efficient algorithms for finding maximum matching in graphs
- Algorithms for two bottleneck optimization problems
- Weakly admissible transformations for solving algebraic assignment and transportation problems
- An algebraic approach to assignment problems
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
This page was built for publication: Trapezoidal matrices and the bottleneck assignment problem
