An extension of the MS pivoting rule to capacitated network flow problems
C. Roos, Miron Tegze (1988)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A Dual Exterior Point Simplex Type Algorithm for the Minimum Cost Network Flow Problem”
An extension of the MS pivoting rule to capacitated network flow problems
Generalization of a Signature Method to Transportation Problems
Kostas Dosios, Konstantinos Paparizzos (1996)
The Yugoslav Journal of Operations Research
Similarity:
A Parametric Visualization Software for the Assignment Problem
Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras (2005)
The Yugoslav Journal of Operations Research
Similarity:
A dual algorithm for the minimal cost flow problem
Veira Martins, Ernesto Q. (1979)
Portugaliae mathematica
Similarity:
A non improving simplex algorithm for transportation problems
Konstantinos Paparrizos (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Sensitivity Analysis of Network Optimization Problems
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
On nonlinear replicated networks.
Laureano F. Escudero (1985)
Qüestiió
Similarity:
In this paper we describe a new type of network flow problem that basically consists of the classical transshipment problem with the following extensions: (1) The replication of a network by producing subnetworks with identical structure, such that they are linked by so-called linking arcs; (2) The objective function terms related to the linking arcs are nondifferentiable nonlinear functions. We also describe an implementation of a linearly constrained nonlinear programming algorithm...
A combinatorial arc tolerance analysis for network flow problems.
Sokkalingam, P.T., Sharma, Prabha (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Finding the k Most Vital Elements of an s-t Planar Directed Network
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
A dual feasible forest algorithm for the linear assignment problem
M. Akgül, O. Ekin (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Ratio rewards in networks
V. Aggarwal, Y. P. Aneja, K. P. K. Nair (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: