An extension of the MS pivoting rule to capacitated network flow problems
C. Roos, Miron Tegze (1988)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
C. Roos, Miron Tegze (1988)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Kostas Dosios, Konstantinos Paparizzos (1996)
The Yugoslav Journal of Operations Research
Similarity:
Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras (2005)
The Yugoslav Journal of Operations Research
Similarity:
Veira Martins, Ernesto Q. (1979)
Portugaliae mathematica
Similarity:
Konstantinos Paparrizos (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
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...
Sokkalingam, P.T., Sharma, Prabha (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
M. Akgül, O. Ekin (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
V. Aggarwal, Y. P. Aneja, K. P. K. Nair (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: