Bottleneck linear programming (Q4117598): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Center Problem: Minimax Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Political Districting by Implicit Enumeration Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bottleneck transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time‐minimizing transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the time transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Composite Simplex Algorithm / rank
 
Normal rank

Latest revision as of 19:36, 12 June 2024

scientific article; zbMATH DE number 3542183
Language Label Description Also known as
English
Bottleneck linear programming
scientific article; zbMATH DE number 3542183

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references