Optimal constructions of event-node networks
Maciej M. Syslo (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “On the minimum dummy-arc problem”
Optimal constructions of event-node networks
Finding the k Most Vital Elements of an s-t Planar Directed Network
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
Optimal tour planning with specified nodes
Gilbert Laporte, Hélène Mercure, Yves Norbert (1984)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Sensitivity Analysis of Network Optimization Problems
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
The order of node removals in influence diagram
Le Minh Trung (1989)
Kybernetika
Similarity:
-colour partitions of acyclic tournaments.
Barcia, Paulo, Cerdeira, J. Orestes (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The labeling method on two-dimensional networks
B. Gabutti, A. Ostanello-Borreani (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The all-to-all alternative route problem
Brian Boffey (1993)
RAIRO - Operations Research - Recherche Opérationnelle
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...
A combinatorial arc tolerance analysis for network flow problems.
Sokkalingam, P.T., Sharma, Prabha (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity: