Keyword: networks: path

Found 387 papers in total
Characterization and generation of a general class of resource-constrained project scheduling problems
Characterization and generation of a general class of resource-constrained project scheduling problems
1995,
This paper addresses the issue of how to generate problem instances of controlled...
The maximum collection problem with time-dependent rewards
The maximum collection problem with time-dependent rewards
1996,
The authors consider a routing problem where the objective is to maximize the sum of...
Solving the minimum route problem by means of a hybrid algorithm in presence of turn penalities
Solving the minimum route problem by means of a hybrid algorithm in presence of turn penalities
1994,
Two methods are normally used to solve the minimum route problem for transportation...
Dual graph representation of transport networks
Dual graph representation of transport networks
1996,
The purpose of this paper is to describe the dual graph technique developed by the...
The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
1993,
This paper introduces the maximum benefit Chinese postman problem (MBCPP) and the...
Grouping PCBs for set-up reduction: A maximum spanning tree approach
Grouping PCBs for set-up reduction: A maximum spanning tree approach
1996,
Grouping of PCBs is a known means for reducing the total set-up time in the automatic...
Multiobjective routing of hazardous materials in stochastic networks
Multiobjective routing of hazardous materials in stochastic networks
1993,
This paper describes a method for determining a set of non-dominated routes in a...
On the k-cut subgraph polytope
On the k-cut subgraph polytope
1994,
The authors consider the problem of finding a minimum-cost set of k- pairwise-disjoint...
A multicriteria Pareto-optimal path algorithm
A multicriteria Pareto-optimal path algorithm
1992,
In this paper the authors present an algorithm for finding, in a multicriteria...
On properties of geometric random problems in the plane
On properties of geometric random problems in the plane
1995,
This paper presents results dealing with properties of well-known geometric random...
Performance oriented spanning trees
Performance oriented spanning trees
1995,
Spanning trees have been widely used for routing in various areas, like computer...
Linear versus nonlinear models for hazmat routing
Linear versus nonlinear models for hazmat routing
1995,
Two models for hazardous routing are briefly described. A condition is derived which,...
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
1994,
This paper considers the inverse shortest paths problem where arc costs are subject to...
Sensitivity of optimal hazmat routes to limited preference specification
Sensitivity of optimal hazmat routes to limited preference specification
1995,
The authors show that a multi-attribute utility (MAU) formulation of the single...
Easing the conscience of the guilty net
Easing the conscience of the guilty net
1994,
This article deals with dynamical system neural networks which find for given vertices...
A note on ‘A perfect forward procedure for a single facility dynamic location/relocation problem’
A note on ‘A perfect forward procedure for a single facility dynamic location/relocation problem’
1994,
In a recent paper, M. Bastian and M. Volkmer proposed a perfect forward algorithm for...
Efficient interactive methods for a class of multiattribute shortest path problems
Efficient interactive methods for a class of multiattribute shortest path problems
1994,
Given an acyclic network and a preference-order relation on paths, when and how can...
Estimating an origin-destination table using a method based on Shortest Augmenting
Estimating an origin-destination table using a method based on Shortest Augmenting
1994,
The most well-known origin-destination estimation methods involve entropy maximization...
Algorithms for the Windy Postman Problem
Algorithms for the Windy Postman Problem
1994,
The Windy Postman Problem (WPP), is an interesting generalization of the classical...
The complexity of one-machine batching problems
The complexity of one-machine batching problems
1993,
Batching problems are combinations of sequencing and partitioning problems. For each...
A dual method for the transportation problem using shortest path updates
A dual method for the transportation problem using shortest path updates
1990,
In this paper the authors propose a method for solving the transportation problem by...
Expert system for AGV managing in bidirectional networks: KADS methodology based approach
Expert system for AGV managing in bidirectional networks: KADS methodology based approach
1994,
This paper presents an expert system prototype for collision avoidance and routing...
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
1994,
The quickest path problem, which was originally proposed by Chen and Chin, is a...
Continuous-time shortest path problems and linear programming
Continuous-time shortest path problems and linear programming
1994,
Shortest path problems are considered for a graph in which edge distances can vary...
Papers per page: