Multiple bottleneck assignment problem (Q1806893): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(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: Categorized Assignment Scheduling: a Tabu Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Generalisations of the Time Minimising Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum perfect bipartite matchings and spanning trees under categorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving combinatorial problems with combined min-max-min-sum objective and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On combined minmax-minsum optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple bottleneck transportation problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00392-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005973146 / rank
 
Normal rank

Latest revision as of 10:24, 30 July 2024

scientific article
Language Label Description Also known as
English
Multiple bottleneck assignment problem
scientific article

    Statements

    Multiple bottleneck assignment problem (English)
    0 references
    0 references
    0 references
    8 November 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    network programming
    0 references
    multiple bottleneck assignment
    0 references
    0 references