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:
George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2009)
The Yugoslav Journal of Operations Research
Similarity:
Kostas Dosios, Konstantinos Paparizzos (1996)
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...
Laureano F. Escudero (1985)
Trabajos de Estadística e Investigación Operativa
Similarity:
In this paper we present the motivation for using the Truncated Newton method in an algorithm that maximises a non-linear function with additional maximin-like arguments subject to a network-like linear system of constraints. The special structure of the network (so-termed replicated quasi-arborescence) allows to introduce the new concept of independent superbasic sets and, then, using second-order information about the objective function without too much computer effort and storage. ...
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
B. Gabutti, A. Ostanello-Borreani (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
V. Aggarwal, Y. P. Aneja, K. P. K. Nair (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
Sokkalingam, P.T., Sharma, Prabha (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity: