Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (Q326488): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1949683236 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57955336 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.3650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental network design with shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling arc maintenance jobs in a network to maximize total flow over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental network design with maximum flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Deterministic Maximum Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous and discrete flows over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-period maintenance scheduling of tree networks with minimum flow disruption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / 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: The Design of Approximation Algorithms / rank
 
Normal rank

Latest revision as of 16:53, 12 July 2024

scientific article
Language Label Description Also known as
English
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
scientific article

    Statements

    Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (English)
    0 references
    0 references
    0 references
    0 references
    12 October 2016
    0 references
    network models
    0 references
    complexity theory
    0 references
    maintenance scheduling
    0 references
    mixed integer programming
    0 references

    Identifiers

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