Approximating the multi-level bottleneck assignment problem (Q453052): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4248190034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multicommodity Multilevel Bottleneck Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic procedure for the crew rostering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with incompatible jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-level bottleneck assignment approach to the bus drivers' rostering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing by the number of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Assembly Line Crew Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multi-index transportation problems with decomposable costs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:24, 5 July 2024

scientific article
Language Label Description Also known as
English
Approximating the multi-level bottleneck assignment problem
scientific article

    Statements

    Approximating the multi-level bottleneck assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    18 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    bottleneck problem
    0 references
    multidimensional assignment
    0 references
    approximation
    0 references
    computational complexity
    0 references
    efficient algorithm
    0 references
    0 references