A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for a $2 \times n$ Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmenting path method for solving linear bottleneck transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the multiple-choice knapsack linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bottleneck transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Bipartite Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An instant solution of the \(2\times n\) bottleneck transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(98)00053-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967185041 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:51, 30 July 2024

scientific article
Language Label Description Also known as
English
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
scientific article

    Statements

    A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (English)
    0 references
    0 references
    0 references
    1999
    0 references
    transportation problem
    0 references
    bottleneck cost
    0 references
    bottleneck transportation problem
    0 references
    linear-time algorithm
    0 references

    Identifiers