Trapezoidal matrices and the bottleneck assignment problem (Q1805450): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic approach to assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly admissible transformations for solving algebraic assignment and transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong regularity of matrices -- a survey of results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong linear independence in bottleneck algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regularity of matrices in min algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniquely solvable bipartite matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two bottleneck optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding maximum matching in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost / rank
 
Normal rank

Latest revision as of 14:31, 23 May 2024

scientific article
Language Label Description Also known as
English
Trapezoidal matrices and the bottleneck assignment problem
scientific article

    Statements