Keyword: networks: path

Found 387 papers in total
Low probability–high consequence considerations in routing hazardous material shipments
Low probability–high consequence considerations in routing hazardous material shipments
1997,
This paper is concerned with the development and analysis of a mathematical model for...
Applications of non-order-preserving path selection to hazardous material routing
Applications of non-order-preserving path selection to hazardous material routing
1997,
In this paper, we consider the problem of determining a path that maximizes a...
A numerical method for controlled routing in large trunk line networks via stochastic control theory
A numerical method for controlled routing in large trunk line networks via stochastic control theory
1994,
The paper discusses a powerful approach to the routing problem in large networks of...
Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours
Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours
1998,
Let G be a complete, weighted, undirected, bipartite graph with n red nodes, n ′...
Graph theoretic relaxations of set covering and set partitioning problems
Graph theoretic relaxations of set covering and set partitioning problems
1995,
In this paper we review the graph theoretic relaxations of the set covering problem...
A logical topology and discrete capacity assignment algorithm for reconfigurable networks
A logical topology and discrete capacity assignment algorithm for reconfigurable networks
1995,
A reconfigurable network is a circuit-switched network where the effective topology...
On mobile robots flow in locally uniform networks
On mobile robots flow in locally uniform networks
1997,
In a mobile robot flow network different levels of flow intensity exist between the...
Optimal routing in a transportation network
Optimal routing in a transportation network
1995,
This paper investigates a routing problem in a public transportation network, more...
Time depending shortest-path problems with applications to railway networks
Time depending shortest-path problems with applications to railway networks
1995,
In this paper the shortest path problem in a time depending transit network is...
Simple local search problems that are hard to solve
Simple local search problems that are hard to solve
1991,
Many algorithms for NP-hard optimization problems find solutions that are locally...
Dynamic selection of harvests with adjacency restrictions: The SHARe model
Dynamic selection of harvests with adjacency restrictions: The SHARe model
1997,
A dynamic forest management model is developed that incorporates spatial and temporal...
Parametric solution for linear bicriteria knapsack models
Parametric solution for linear bicriteria knapsack models
1996,
Linear weighing is a common approach to handle multiple criteria and the...
A two phase, cooperative detailed/global parallel wire-routing algorithm
A two phase, cooperative detailed/global parallel wire-routing algorithm
1996,
This paper introduces a parallel global and detailed wire router. This router is...
Complexity of a restricted chinese postman problem
Complexity of a restricted chinese postman problem
1996,
The Chinese Postman Problem (CPP) on mixed graphs is shown to be NP-complete. It...
Efficient algorithms to find optimal paths in a public transportation network
Efficient algorithms to find optimal paths in a public transportation network
1996,
This paper, studies problems related to public transportation routing in Singapore....
Supporting rural telecommunications: A compromise solutions approach
Supporting rural telecommunications: A compromise solutions approach
1996,
Rural telecommunication networks can foster the development of needed infrastructures...
On bicriterion minimal spanning trees: An approximation
On bicriterion minimal spanning trees: An approximation
1996,
In this paper the authors focus on the problem of computing the set of efficient...
A computational improvement for a shortest paths ranking algorithm
A computational improvement for a shortest paths ranking algorithm
1994,
In this short note the authors present a computational improvement for the shortest...
Shortest paths algorithms: Theory and experimental evaluation
Shortest paths algorithms: Theory and experimental evaluation
1996,
The authors conduct an extensive computational study of shortest paths algorithms,...
Optimal tool partitioning rules for numerically controlled punch press operations
Optimal tool partitioning rules for numerically controlled punch press operations
1994,
The purpose of this paper is to formulate and solve an optimization problem arising in...
A relaxation-based purning technique for a class of stochastic shortest path problems
A relaxation-based purning technique for a class of stochastic shortest path problems
1996,
In this paper a form of the stochastic shortest path problem is considered where the...
Alternating paths in edge-colored complete graphs
Alternating paths in edge-colored complete graphs
1995,
In an edge-colored graph, the paper says that a path is alternating if it has at least...
Multicriteria optimum path problems
Multicriteria optimum path problems
1995,
The authors consider the problem of finding paths in a network between two certain...
Minimizing resource availability costs in time-limited project networks
Minimizing resource availability costs in time-limited project networks
1995,
The paper considers the problem of minimizing renewable resource availabilty costs in...
Papers per page: