Transportation networks with random arc capacities
Revue française d automatique informatique recherche opérationnelle Recherche opérationnellePublished 1 January 1972Open access
P. J. Doulliez, E. Jamoulle
Citations159
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The method is based upon a décomposition principle which allows the transformation of the network capacity state space into non-overlapping subsets and the expected amount of unsupplied flow is found.
Abstract
avec les conditions générales d'utilisation (http://www.numdam.org/
Keywords
Engineering
Flows in networks
4,080 Citations1962D. R. Ford, D. R. Fulkerson
Management ScienceMaximal Flow in a Multi-Terminal Network with Any One Arc Subject to Failure
11 Citations1971P. J. Doulliez, M. R. Rao
In this paper two methods are given for solving the problem of finding the maximum time up to which all demands can be satisfied in a multi-terminal network when the arc capacities are specified.
Revue française d informatique et de recherche opérationnelle Série verteProbability distribution function for the capacity of a multiterminal network
8 Citations1971P. J. Doulliez
Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale, toute copie oor impression de ce fichier doit contenir la présente mention of copyright.