Efficient continuous-time dynamic network flow algorithms (Q1306377): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Lisa K. Fleischer / rank
Normal rank
 
Property / author
 
Property / author: Éva Tardos / rank
Normal rank
 
Property / author
 
Property / author: Lisa K. Fleischer / rank
 
Normal rank
Property / author
 
Property / author: Éva Tardos / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Continuous Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous-time network simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4895155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dynamic network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transient flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal dynamic routing in communication networks with continuous traffic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal flows in networks with multiple sources and sinks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal, Lexicographic, and Dynamic Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On continuous network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous-Time Flows in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive discretization algorithm for a class of continuous network programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for a Class of Continuous Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of General Dynamic Network Programs with Arc Time-Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Universal Maximal Dynamic Flows in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bad network problem for the simplex method and other minimum cost flow algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(98)00037-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039657689 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:39, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficient continuous-time dynamic network flow algorithms
scientific article

    Statements

    Efficient continuous-time dynamic network flow algorithms (English)
    0 references
    19 December 1999
    0 references
    network flows
    0 references
    dynamic network flows
    0 references
    continuous time flows
    0 references
    0 references
    0 references

    Identifiers