On locating a single path-like facility in a general graph
Abraham P. Punnen (1997)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Abraham P. Punnen (1997)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
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.
Martin Klaučo, Slavomír Blažek, Michal Kvasnica (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
A path planning problem for a heterogeneous vehicle is considered. Such a vehicle consists of two parts which have the ability to move individually, but one of them has a shorter range and is therefore required to keep in a close distance to the main vehicle. The objective is to devise an optimal path of minimal length under the condition that at least one part of the heterogeneous system visits all desired waypoints exactly once. Two versions of the problem are considered. One assumes...
Jack Brimberg, Ephraim Korach, Mokhtar Amami (2005)
The Yugoslav Journal of Operations Research
Similarity:
Emilio Carrizosa, Nenad Mladenović, Raca Todosijević (2011)
The Yugoslav Journal of Operations Research
Similarity:
T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2010)
RAIRO - Operations Research
Similarity:
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...
Feuerstein, Esteban, Marchetti-Spaccamela, Alberto (1998)
Journal of Graph Algorithms and Applications
Similarity:
Horak, Peter, Rosa, Alexander (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bezdek, Andras (1999)
Beiträge zur Algebra und Geometrie
Similarity:
Teodros Getachew, Michael Kostreva, Laura Lancaster (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...
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...