Finding the k Most Vital Elements of an s-t Planar Directed Network
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “Sensitivity Analysis of Network Optimization Problems”
Finding the k Most Vital Elements of an s-t Planar Directed Network
Aggregation of networks
Jan Pelikán (1997)
Kybernetika
Similarity:
Scheduled hot-potato routing.
Naor, Joseph, Orda, Ariel, Rom, Raphael (1998)
Journal of Graph Algorithms and Applications
Similarity:
The labeling method on two-dimensional networks
B. Gabutti, A. Ostanello-Borreani (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
An extension of the MS pivoting rule to capacitated network flow problems
C. Roos, Miron Tegze (1988)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
A combinatorial arc tolerance analysis for network flow problems.
Sokkalingam, P.T., Sharma, Prabha (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity:
A Dual Exterior Point Simplex Type Algorithm for the Minimum Cost Network Flow Problem
George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2009)
The Yugoslav Journal of Operations Research
Similarity:
Multicriteria Optimum Path Problems
Dimiter Ivanchev, Dimitris Kydros (1995)
The Yugoslav Journal of Operations Research
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...