Single Commodity Flow Requirements

  • Christelle Wynants
Part of the Combinatorial Optimization book series (COOP, volume 8)


In this chapter we consider the minimum network synthesis problem with non-simultaneous single commodity flow requirements (or NSSC for short). We distinguish between the two applications of this problem, namely the restoration and the multi-hour applications, since we prove that some classes do not have the same complexity. As the multi-hour problem was covered by Gomory and Hu [32] [33], and by Sridhar and Chandrasekaran [75], we mainly study the Line Restoration (LR) problem.


Steiner Tree Hamiltonian Cycle Steiner Tree Problem Star Graph Solution Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Christelle Wynants
    • 1
  1. 1.Service de Mathématiques de la Gestion, Institut de Statistique et de Recherche OpérationnelleUniversité Libre de BruxellesBrusselsBelgium

Personalised recommendations