Robust flows over time: models and complexity results (Q1785195): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Maximizing residual flow under an arc destruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dynamic network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust and Adaptive Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-Constrained Orientations of Embedded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum residual flow problem: <i>NP</i>‐hardness with two‐arc destruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Maximal Dynamic Flows from Static Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous and discrete flows over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Gas Network Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows over Time with Load-Dependent Transit Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Network Flows over Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank

Revision as of 16:42, 16 July 2024

scientific article
Language Label Description Also known as
English
Robust flows over time: models and complexity results
scientific article

    Statements

    Robust flows over time: models and complexity results (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 September 2018
    0 references
    dynamic network flows
    0 references
    uncertain travel times of flow
    0 references
    temporally repeated flows
    0 references
    optimality gap
    0 references

    Identifiers

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