Keyword: networks: path

Found 387 papers in total
A fault recovery method for optical means of data exchange
A fault recovery method for optical means of data exchange
2013,
We propose a method to speed up detection, neutralization, and recovery of multiple...
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
2014,
We reconsider the well‐studied Selfish Routing game with affine latency...
Critical street links for demand responsive feeder transit services
Critical street links for demand responsive feeder transit services
2013,
This paper presents a methodology to identify and locate critical links in a grid...
Extending travel-time based models for dynamic network loading and assignment, to achieve adherence to first-in-first-out and link capacities
Extending travel-time based models for dynamic network loading and assignment, to achieve adherence to first-in-first-out and link capacities
2014,
An important class of models for macroscopic dynamic network loading (DNL) and dynamic...
UBMR‐CA: Utility‐based multicast routing and channel assignment with varying traffic demands in multi‐radio multi‐channel wireless mesh networks
UBMR‐CA: Utility‐based multicast routing and channel assignment with varying traffic demands in multi‐radio multi‐channel wireless mesh networks
2013,
Over the years, a wireless mesh network (WMN) has been considered as a leading...
A memetic algorithm for the open capacitated arc routing problem
A memetic algorithm for the open capacitated arc routing problem
2013,
In this paper, an open capacitated arc routing problem (OCARP) is defined and...
On Boundedness of Q‐Learning Iterates for Stochastic Shortest Path Problems
On Boundedness of Q‐Learning Iterates for Stochastic Shortest Path Problems
2013,
We consider a totally asynchronous stochastic approximation algorithm,...
GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance
GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance
2013,
In the paper, we consider a Chinese postman problem and show how integration of an...
Intra‐domain traffic engineering with shortest path routing protocols
Intra‐domain traffic engineering with shortest path routing protocols
2013,
Throughout the last decade, extensive deployment of popular intra‐domain...
Metropolis–Hastings sampling of paths
Metropolis–Hastings sampling of paths
2013,
We consider the previously unsolved problem of sampling paths according to a given...
An efficient dynamic model for solving the shortest path problem
An efficient dynamic model for solving the shortest path problem
2013,
The shortest path problem is the classical combinatorial optimization problem arising...
A heuristic approach based on shortest path problems for integrated flight, aircraft, and passenger rescheduling under disruptions
A heuristic approach based on shortest path problems for integrated flight, aircraft, and passenger rescheduling under disruptions
2013,
In this paper, we present a heuristic method to solve an airline disruption management...
Fast minimum float computation in activity networks under interval uncertainty
Fast minimum float computation in activity networks under interval uncertainty
2013,
This paper concerns project scheduling under uncertainty. The project is modeled as an...
A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
2000,
The Algorithm in this paper is designed to find the shortest path in a network given...
A computational study of solution approaches for the resource constrained elementary shortest path problem
A computational study of solution approaches for the resource constrained elementary shortest path problem
2012,
We present the results of a computational investigation of solution approaches for the...
A distributed approximation algorithm for the bottleneck connected dominating set problem
A distributed approximation algorithm for the bottleneck connected dominating set problem
2012,
Some of the most popular routing protocols for wireless sensor networks require a...
Shortest path problems with left‐side time windows
Shortest path problems with left‐side time windows
2012,
‘Time is life’ is popular now, considering of some optimization models...
Match bus stops to a digital road network by the shortest path model
Match bus stops to a digital road network by the shortest path model
2012,
We investigate the bus stop matching problem that determines the associated road link...
On the fractionality of the path packing problem
On the fractionality of the path packing problem
2012,
Given an undirected graph G =( N , E ), a subset T of its nodes and an undirected...
A tractable class of algorithms for reliable routing in stochastic networks
A tractable class of algorithms for reliable routing in stochastic networks
2012,
The goal of this article is to provide the theoretical basis for enabling tractable...
Algorithms for the quickest path problem and the reliable quickest path problem
Algorithms for the quickest path problem and the reliable quickest path problem
2012,
The quickest path problem consists of finding a path in a directed network to transmit...
On the Complexity of Optimal Hotlink Assignment
On the Complexity of Optimal Hotlink Assignment
2012,
The concept of hotlink assignment aims at reducing the navigation effort for users of...
Optimization of Internet interconnection policy in the top percentile pricing framework
Optimization of Internet interconnection policy in the top percentile pricing framework
2012,
Internet is a worldwide network composed of interconnected but independent networks,...
Analysis of the contact graph routing algorithm: Bounding interplanetary paths
Analysis of the contact graph routing algorithm: Bounding interplanetary paths
2012,
Interplanetary communication networks comprise orbiters, deep‐space relays, and...
Papers per page: