Weakly admissible transformations for solving algebraic assignment and transportation problems
From MaRDI portal
Cited in
(16)- A condition for the strong regularity of matrices in the minimax algebra
- Strong linear independence in bottleneck algebra
- Selected topics on assignment problems
- Which matrices are immune against the transportation paradox?
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
- Trapezoidal matrices and the bottleneck assignment problem
- Perspectives of Monge properties in optimization
- On three basic methods for solving bottleneck transportation problems
- An out-of-kilter method for the algebraic circulation problem
- An algorithm for algebraic assignment problems
- Duality for algebraic linear programming
- Minimizing variation of production rates in just-in-time systems: A survey
- A general Hungarian method for the algebraic transportation problem
- An augmenting path method for solving linear bottleneck transportation problems
- Duality and admissible transformations in combinatorial optimization
- An augmenting path method for solving linear bottleneck assignment problems
This page was built for publication: Weakly admissible transformations for solving algebraic assignment and transportation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875737)
