Keyword: networks: path

Found 387 papers in total
Some inverse optimization problems under the Hamming distance
Some inverse optimization problems under the Hamming distance
2006,
Given a feasible solution to a particular combinatorial optimization problem defined...
Transportation problem on the general network and its algorithm
Transportation problem on the general network and its algorithm
2005,
In this paper, a new algorithm that directly solves the transshipment problem is given...
A special case of transfer lines balancing by graph approach
A special case of transfer lines balancing by graph approach
2006,
A balancing problem for paced production lines with workstations in series and blocks...
Exact disclosure prevention in two-dimensional statistical tables
Exact disclosure prevention in two-dimensional statistical tables
2005,
We propose new formulations for the exact disclosure problem and develop Lagrangian...
On a bi-dimensional dynamic alternative routing method
On a bi-dimensional dynamic alternative routing method
2005,
The analysis of a bi-dimensional dynamic routing model for alternative routing...
Applying the shortest-path-counting problem to evaluate the importance of city road segments and the connectedness of the network-structured system
Applying the shortest-path-counting problem to evaluate the importance of city road segments and the connectedness of the network-structured system
2004,
We consider the shortest-path-counting problem (SPCP), which asks how many shortest...
Finding the K shortest hyperpaths using reoptimization
Finding the K shortest hyperpaths using reoptimization
2006,
We present some reoptimization techniques for computing (shortest) hyperpath weights...
A tool for computing computer network reliability
A tool for computing computer network reliability
2005,
The computation of the reliability of a computer network is one of the important tasks...
Arriving on time
Arriving on time
2005,
This research proposes a procedure for identifying routing policies in stochastic...
On finding dissimilar Pareto-optimal paths
On finding dissimilar Pareto-optimal paths
2005,
The aim of the present paper is to provide a methodology for finding a set of...
Improved algorithms for replacement paths problems in restricted graphs
Improved algorithms for replacement paths problems in restricted graphs
2005,
We present near-optimal algorithms for two problems related to finding the replacement...
Best-routing algorithm for public transportation systems
Best-routing algorithm for public transportation systems
2004,
This paper presents a best-routing algorithm for public transportation systems on the...
Improved approximations for tour and tree covers
Improved approximations for tour and tree covers
2003,
A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree...
Multiple routing strategies in a labelled network
Multiple routing strategies in a labelled network
2001,
We present here models and algorithms for the construction of efficient path systems,...
Simple on-line algorithms for the maximum disjoint paths problem
Simple on-line algorithms for the maximum disjoint paths problem
2004,
In this paper we study the classical problem of finding disjoint paths in graphs. This...
Finding K shortest looping paths in a traffic-light network
Finding K shortest looping paths in a traffic-light network
2005,
In this paper we consider a traffic-light network where every node in the network is...
The allocation of time and training to ensure a well-trained “next generation” in a large business
The allocation of time and training to ensure a well-trained “next generation” in a large business
2000,
We describe an OR technique which plans the allotment of time of the collaborators of...
Reallocation of paths of available bit rate services in a multistage interconnection network-type asynchronous transfer mode switch network
Reallocation of paths of available bit rate services in a multistage interconnection network-type asynchronous transfer mode switch network
2004,
In this paper, we develop algorithms for reallocating paths of available bit rate...
The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction
The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction
2004,
In this paper, we propose a new criterion, namely the minimal spanning tree...
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
2004,
In this article, we propose a solution procedure for the Elementary Shortest Path...
On the minimum number of wavelengths in multicast trees in Wavelength Division Multiplexing networks
On the minimum number of wavelengths in multicast trees in Wavelength Division Multiplexing networks
2005,
We consider the problem of minimizing the number of wavelengths needed to connect a...
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
2005,
In this article, we study the modulation of intensity matrices arising in cancer...
Shortest route computation in distributed systems
Shortest route computation in distributed systems
2004,
This paper presents a polynomial time algorithm for computing the shortest route in...
Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
2004,
This paper deals with the Arc Routing Problem with Intermediate Facilities under...
Papers per page: