On bottleneck assignment problems under categorization. (Q1422389): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck assignment problems under categorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:01, 6 June 2024

scientific article
Language Label Description Also known as
English
On bottleneck assignment problems under categorization.
scientific article

    Statements

    On bottleneck assignment problems under categorization. (English)
    0 references
    0 references
    14 February 2004
    0 references
    0 references
    Bottleneck problems
    0 references
    Algorithms
    0 references
    Complexity
    0 references
    Assignment problem
    0 references