A parametric algorithm for convex cost network flow and related problems (Q789313): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An algorithm for optimizing network flow capacity under economies of scale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Allocation of Aircraft to Routes—An Example of Linear Programming Under Uncertain Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Search Method to Locate Negative Cycles in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Network Flow Computation for Project Cost Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the Capacity of a Network: The Parametric Budget Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating Maximal Flows in a Network with Positive Gains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical-Path Planning and Scheduling: Mathematical Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimal cost flow problem with convex costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum flows in general communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5550828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Max Flows with Gains and Pure Min-Cost Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Algorithm to Solve Network Flow Problems with Convex Costs / rank
 
Normal rank

Latest revision as of 10:57, 14 June 2024

scientific article
Language Label Description Also known as
English
A parametric algorithm for convex cost network flow and related problems
scientific article

    Statements

    A parametric algorithm for convex cost network flow and related problems (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    computational complexity
    0 references
    polynomial boundedness
    0 references
    computational results
    0 references
    context cost network flow problem
    0 references
    minimum cost flow
    0 references
    parametric algorithm
    0 references
    optimum basis structure
    0 references
    shortest paths
    0 references
    large size problems
    0 references
    project cost curve
    0 references
    CPM network
    0 references
    optimum capacity expansion
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references