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:
C. Roos, Miron Tegze (1988)
Acta Universitatis Carolinae. Mathematica et Physica
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...
Konstantinos Paparrizos (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras (2005)
The Yugoslav Journal of Operations Research
Similarity:
Dionisio Pérez-Brito, Nenad Mladenović, José A. Moreno-Pérez (1998)
The Yugoslav Journal of Operations Research
Similarity:
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. ...
M. Akgül, O. Ekin (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Bar-Yehuda, Reuven, Even, Guy, Feldmann, Jon, Naor, Joseph (2001)
Journal of Graph Algorithms and Applications
Similarity:
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity: