Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57955352, #quickstatements; #temporary_batch_1712688784189
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Universally maximum flow with piecewise-constant capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Continuous and discrete flows over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / 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: Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / 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: Decomposing inventory routing problems with approximate value functions / rank
 
Normal rank

Revision as of 00:12, 9 July 2024

scientific article
Language Label Description Also known as
English
Scheduling arc maintenance jobs in a network to maximize total flow over time
scientific article

    Statements

    Scheduling arc maintenance jobs in a network to maximize total flow over time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 September 2014
    0 references
    network flows
    0 references
    scheduling
    0 references
    maintenance planning
    0 references
    local search
    0 references
    hybrid algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers