Reserving resilient capacity for a single commodity with upper-bound constraints

DOI10.1002/NET.10064MaRDI QIDQ4804167zbMATH OpenOpenAlexFDO

Authors

Publication date 10 April 2003

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10064

zbMATH Keywords

capacity reservationnetwork flowsresilience

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Reserving resilient capacity in a network
• Maximizing residual flow under an arc destruction
• A distributed method for optimal capacity reservation
• Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes
• Maximizing residual capacity in connection-oriented networks

Cited in

(3)

• Reserving resilient capacity in a network
• Single-Sink Multicommodity Flow with Side Constraints
• Capacity reservation under supply uncertainty

This page was built for publication: Reserving resilient capacity for a single commodity with upper-bound constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804167)