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
linear independencetrapezoidal matrixalgebraic linear systembinary search techniquesbottleneck algebralinear bottleneck assignment problemstrong permanentstrongly independent columnsstrongly regular matrix
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
Cites Work