On the minimum dummy-arc problem
David J. Michael, Jerzy Kamburowski (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “-colour partitions of acyclic tournaments.”
On the minimum dummy-arc problem
Multicriteria Optimum Path Problems
Dimiter Ivanchev, Dimitris Kydros (1995)
The Yugoslav Journal of Operations Research
Similarity:
Sensitivity Analysis of Network Optimization Problems
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
On recursively directed hypercubes.
Domshlak, Carmel (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The order of node removals in influence diagram
Le Minh Trung (1989)
Kybernetika
Similarity:
Acyclic orientations with path constraints
Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan, Cid C. de Souza (2008)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diameter constraints are closely related to the optimal solutions of the vertex coloring and frequency assignment problems. In this paper we introduce a linear programming formulation of acyclic orientations with path constraints, and discuss its use in the solution of the vertex coloring problem and some versions...
Multiple routing strategies in a labelled network
J. Maublanc, D. Peyrton, A. Quilliot (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.
The labeling method on two-dimensional networks
B. Gabutti, A. Ostanello-Borreani (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Finding the k Most Vital Elements of an s-t Planar Directed Network
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
The arc-width of a graph.
Barát, János, Hajnal, Péter (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A combinatorial arc tolerance analysis for network flow problems.
Sokkalingam, P.T., Sharma, Prabha (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity: