Keyword: networks: path

Found 387 papers in total
A fast algorithm for shortest path problem for network with turn penalties and prohibitions
A fast algorithm for shortest path problem for network with turn penalties and prohibitions
1998,
Shortest path problem in road network with turn penalties and prohibitions frequently...
Shortest path problems with time windows constraints: Application to vehicle routing
Shortest path problems with time windows constraints: Application to vehicle routing
1997,
We solve the time dependent shortest path problem. This problem consists in finding a...
An efficient procedure for designing single allocation hub and spoke systems
An efficient procedure for designing single allocation hub and spoke systems
1998,
Given the widespread use of the hub and spoke network architecture and its growing...
A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
1998,
In this paper we study the problem of finding Origin–Destination ( O–D...
Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs
Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs
1999,
We address the problem of assigning probabilities at discrete time instants for...
The Steiner tree problem with hop constraints
The Steiner tree problem with hop constraints
1999,
The Steiner tree problem in graphs is to determine a minimum cost subgraph of a given...
Efficient solution procedure and reduced size formulations for p-hub location problems
Efficient solution procedure and reduced size formulations for p-hub location problems
1998,
In this paper we consider the uncapacitated p -hub location problems, where multiple...
A multi-modal approach to the location of a rapid transit line
A multi-modal approach to the location of a rapid transit line
1998,
The location of a rapid transit line (RTL) represents a very complex decision problem...
The rural postman problem with deadline classes
The rural postman problem with deadline classes
1998,
Vehicle routing problems with general time windows are extremely difficult to solve....
A generalized linear programming model for nurse scheduling
A generalized linear programming model for nurse scheduling
1998,
This paper presents a 0–1 column generation model with a resource constrained...
Two engineering applications of a constrained shortest-path model
Two engineering applications of a constrained shortest-path model
1997,
This paper presents integer programming models for the determination of (a) optimal...
On the concavity of delivery games
On the concavity of delivery games
1997,
Delivery games, introduced by Hamers, Borm, van de Leensel and Tijs in 1994, are...
Expected shortest paths in dynamic and stochastic traffic networks
Expected shortest paths in dynamic and stochastic traffic networks
1998,
The dynamic and stochastic shortest path problem (DSSPP) is defined as finding the...
Least-hop path planning using neural networks
Least-hop path planning using neural networks
1997,
Recently, application of neural networks using their parallel processing feature has...
Parallel search algorithms for discrete optimization problems
Parallel search algorithms for discrete optimization problems
1995,
Discrete optimization problems (DOPs) arise in various applications such as planning,...
A branch and bound algorithm for solving a capacitated subtree of a tree problem in local access telecommunication networks
A branch and bound algorithm for solving a capacitated subtree of a tree problem in local access telecommunication networks
1997,
Given a rooted tree T with node profits and node demands, the capacitated subtree of a...
Tabu search and ejection chains – application to a node weighted version of the cardinality-constrained TSP
Tabu search and ejection chains – application to a node weighted version of the cardinality-constrained TSP
1997,
A cardinality-constrained travelling salesman problem (CC-TSP) requires the salesman...
Primary and secondary route selection in backbone communication networks
Primary and secondary route selection in backbone communication networks
1996,
This paper addresses the problem of selecting primary and secondary routes for every...
Using decomposition in large-scale highway network design with a Quasi-Optimization heuristic
Using decomposition in large-scale highway network design with a Quasi-Optimization heuristic
1998,
The highway network design problem deals with the selection of links from a base...
On the complexity of testing membership in the core of min-cost-spanning tree games
On the complexity of testing membership in the core of min-cost-spanning tree games
1997,
Let N = {1,…, n } be a finite set of players and K N the complete graph on the...
Minimum cost forest games
Minimum cost forest games
1997,
In this paper we consider a generalization of the minimum cost spanning tree game. The...
A dynamic survey of graph labeling
A dynamic survey of graph labeling
1998,
A vertex labeling of a graph G is an assignment f of labels to the vertices of G that...
Braess paradox: Maximum penalty in a Minimal Critical Network
Braess paradox: Maximum penalty in a Minimal Critical Network
1997,
A ‘simplest anti-symmetric’ two-path network is described which exhibits...
Incorporating insurance costs in hazardous materials routing models
Incorporating insurance costs in hazardous materials routing models
1997,
The economic loss associated with the involvement of a hazardous materials truck in an...
Papers per page: