Finding the k Most Vital Elements of an s-t Planar Directed Network
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
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.
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
Charles L. Hagopian (1975)
Colloquium Mathematicae
Similarity:
T. Benton (1930)
Fundamenta Mathematicae
Similarity:
David J. Michael, Jerzy Kamburowski (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Arthur, David (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Herbert Fleischner, Emanuel Wenger (1989)
Archivum Mathematicum
Similarity:
Barát, János, Hajnal, Péter (2001)
The Electronic Journal of Combinatorics [electronic only]
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...
William Gilbert (1972)
Fundamenta Mathematicae
Similarity:
Veira Martins, Ernesto Q. (1979)
Portugaliae mathematica
Similarity: