Restricted recourse strategies for bounding the expected network recourse function

Linos F. Frantzeskakis, Warren Buckler Powell

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


This paper presents bounds for the expected recourse function for stochastic programs with network recourse. Cyclic recourse, a concept introduced by Wallace [18], allows the approximation of the recourse problem by restricting the optimal flows on a set of cycles and by augmenting the original network to induce separability. We introduce a new procedure that uses again a set of cycles but does not approximate the problem; instead it solves it heuristically without altering the original network or requiring separability. The method produces tighter bounds and is computationally feasible for large networks. Numerical experiments with selected networks illustrate the effectiveness of the approach.

Original languageEnglish (US)
Pages (from-to)261-287
Number of pages27
JournalAnnals of Operations Research
StatePublished - 1996

All Science Journal Classification (ASJC) codes

  • General Decision Sciences
  • Management Science and Operations Research


Dive into the research topics of 'Restricted recourse strategies for bounding the expected network recourse function'. Together they form a unique fingerprint.

Cite this