Reserving Resilient Capacity for a Single Commodity with Upper-Bound Constraints

Networks

Volumn 41, Issue 2, 2003, Pages 87-96

  Brightwell, G ^a   Oriolo, G ^b   Shepherd, F B ^c  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Capacity reservation; Network flows; Resilience

Indexed keywords

CAPACITY RESERVATION; NETWORK FLOWS; RESILENCE;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; OPTIMIZATION; SET THEORY; THEOREM PROVING; VECTORS;

PROBLEM SOLVING;

EID: 2142787969     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10064     Document Type: Article

References (4)

1. A.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows-Theory, algorithms, and applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. G. Brightwell, G. Oriolo, and B. Shepherd, Reserving resilient capacity in a network, SIAM J Disc Math 14 (2001), 524-539.
3. S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theor Comput Sci 10 (1980), 111-121.
4. G.S. Lueker, Two NP-complete problems in non negative integer programming, Report No. 178, Computer Science Laboratory, Princeton University, 1975.