Strong linear independence in bottleneck algebra

DOI10.1016/0024-3795(87)90085-1zbMath0629.90093OpenAlexW2128160792MaRDI QIDQ1094338

Peter Szabó, Peter Butkovic, Katarína Cechlárova

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(87)90085-1

zbMATH Keywords

linear independencetrapezoidal matrixalgebraic linear systembinary search techniquesbottleneck algebralinear bottleneck assignment problemstrong permanentstrongly independent columnsstrongly regular matrix

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Determinants, permanents, traces, other special matrix functions (15A15) Deterministic scheduling theory in operations research (90B35) Programming in abstract spaces (90C48) Ordered groups (06F15) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (15)

Dioïds and semirings: Links to fuzzy sets and other applications ⋮ Monotone eigenspace structure in max-min algebra ⋮ Solvability and unique solvability of max-min fuzzy equations ⋮ Strong regularity of matrices in a discrete bounded bottleneck algebra ⋮ Unique solvability of max-min fuzzy equations and strong regularity of matrices over fuzzy algebra ⋮ On the dimension of max-min convex sets ⋮ Optimal paths in oriented graphs and eigenvectors in max-⊗ systems ⋮ The general trapezoidal algorithm for strongly regular max--min matrices. ⋮ Strong regularity of matrices in general max-min algebra ⋮ Strong regularity of matrices in a discrete bottleneck algebra ⋮ Linear independence in bottleneck algebras ⋮ Eigenvectors in Bottleneck algebra ⋮ A survey on fuzzy relational equations. I: Classification and solvability ⋮ Trapezoidal matrices and the bottleneck assignment problem ⋮ Strong regularity of matrices -- a survey of results

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong linear independence in bottleneck algebra