Finding the k Most Vital Elements of an s-t Planar Directed Network
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “Finding Minimal Branchings With a Given Number of Arcs”
Finding the k Most Vital Elements of an s-t Planar Directed Network
Characterizing the arc by composition of functions
Charles L. Hagopian (1975)
Colloquium Mathematicae
Similarity:
On Continuous Curves which are Homogeneous except for a Finite Number of Points
T. Benton (1930)
Fundamenta Mathematicae
Similarity:
On the minimum dummy-arc problem
David J. Michael, Jerzy Kamburowski (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The restricted arc-width of a graph.
Arthur, David (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-favouring Eulerian trails in digraphs
Herbert Fleischner, Emanuel Wenger (1989)
Archivum Mathematicum
Similarity:
The arc-width of a graph.
Barát, János, Hajnal, Péter (2001)
The Electronic Journal of Combinatorics [electronic only]
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...
Menger's Theorem for topological spaces
William Gilbert (1972)
Fundamenta Mathematicae
Similarity:
A dual algorithm for the minimal cost flow problem
Veira Martins, Ernesto Q. (1979)
Portugaliae mathematica
Similarity:
Optimal constructions of event-node networks
Maciej M. Syslo (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: