Strong linear independence in bottleneck algebra
linear independencetrapezoidal matrixalgebraic linear systembinary search techniquesbottleneck algebralinear bottleneck assignment problemstrong permanentstrongly independent columnsstrongly regular matrix
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Determinants, permanents, traces, other special matrix functions (15A15) Programming in abstract spaces (90C48) Ordered groups (06F15) Vector spaces, linear dependence, rank, lineability (15A03)
- Strong regularity of matrices -- a survey of results
- Solving linear bottleneck assignment problems via strong spanning trees
- Strong regularity of matrices in a discrete bottleneck algebra
- scientific article; zbMATH DE number 894358
- A condition for the strong regularity of matrices in the minimax algebra
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 3982944 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A condition for the strong regularity of matrices in the minimax algebra
- Linear and combinatorial optimization in ordered algebraic structures
- Minimax algebra
- Weakly admissible transformations for solving algebraic assignment and transportation problems
- Strong regularity of matrices in a discrete bottleneck algebra
- A condition for the strong regularity of matrices in the minimax algebra
- Linear independence in bottleneck algebras
- A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem
- A survey on fuzzy relational equations. I: Classification and solvability
- Solvability and unique solvability of max-min fuzzy equations
- On the dimension of max-min convex sets
- Dioïds and semirings: Links to fuzzy sets and other applications
- Strong regularity of matrices in general max-min algebra
- Trapezoidal matrices and the bottleneck assignment problem
- Strong regularity of matrices -- a survey of results
- Eigenvectors in Bottleneck algebra
- Unique solvability of max-min fuzzy equations and strong regularity of matrices over fuzzy algebra
- Monotone eigenspace structure in max-min algebra
- The general trapezoidal algorithm for strongly regular max--min matrices.
- Strong regularity of matrices in a discrete bounded bottleneck algebra
- Optimal paths in oriented graphs and eigenvectors in \(\max\)-\(\otimes\) systems
This page was built for publication: Strong linear independence in bottleneck algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094338)
