Transportation networks with random arc capacities

P. Doulliez; E. Jamoulle

Displaying similar documents to “Transportation networks with random arc capacities”

Probability distribution function for the capacity of a multiterminal network

Pierre Doulliez (1971)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The labeling method on two-dimensional networks

B. Gabutti, A. Ostanello-Borreani (1974)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Sensitivity Analysis of Network Optimization Problems

Dimiter Ivanchev (1995)

The Yugoslav Journal of Operations Research

Similarity:

Optimal constructions of event-node networks

Maciej M. Syslo (1981)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

On the minimum dummy-arc problem

David J. Michael, Jerzy Kamburowski (1993)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The inverse maximum flow problem considering norm

Adrian Deaconu (2008)

RAIRO - Operations Research

Similarity:

The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast ⋅log()) time complexity algorithm for solving this problem is presented, where is the number of arcs and is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The...