Keyword: networks: path

Found 387 papers in total
The impact of supplier development on buyer competitive advantage: A path analytic model
The impact of supplier development on buyer competitive advantage: A path analytic model
2012,
As manufacturing firms increasingly realize that supplier performance is crucial to...
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
2002,
We present efficient algorithms for solving polygonal‐path approximation...
Identifying large robust network clusters via new compact formulations of maximum k‐club problems
Identifying large robust network clusters via new compact formulations of maximum k‐club problems
2012,
Network robustness issues are crucial in a variety of application areas. In many...
General network design: A unified view of combined location and network design problems
General network design: A unified view of combined location and network design problems
2012,
This paper presents a unified framework for the general network design problem which...
A comparison of heuristic best‐first algorithms for bicriterion shortest path problems
A comparison of heuristic best‐first algorithms for bicriterion shortest path problems
2012,
A variety of algorithms have been proposed to solve the bicriterion shortest path...
A three‐stage approach for the resource‐constrained shortest path as a sub‐problem in column generation
A three‐stage approach for the resource‐constrained shortest path as a sub‐problem in column generation
2012,
This paper focuses on the common scenario in which the resource‐constrained...
A q ‐Analogue of the Path Length of Binary Search Trees
A q ‐Analogue of the Path Length of Binary Search Trees
2001,
A reformulation of the path length of binary search trees is given in terms of...
An efficient label setting/correcting shortest path algorithm
An efficient label setting/correcting shortest path algorithm
2012,
We design a new label shortest path algorithm by applying the concept of a pseudo...
On models of developing systems and their applications
On models of developing systems and their applications
2011,
We consider integral models based on the mathematical model proposed by V.M. Glushkov....
An Efficient and Robust Design for Transshipment Networks
An Efficient and Robust Design for Transshipment Networks
2011,
Transshipment, the sharing of inventory among parties at the same echelon level of a...
Combinatorial identification problems and graph powers
Combinatorial identification problems and graph powers
2011,
This is a summary of the author’s PhD thesis supervised by Pr. Olivier Hudry and...
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
2011,
Given an undirected network with link capacities and a set of commodities with known...
Efficient techniques and tools for intra-domain traffic engineering
Efficient techniques and tools for intra-domain traffic engineering
2011,
Intra-domain routing protocols are based on Shortest Path First (SPF) routing, where...
An efficient solution algorithm for solving multi‐class reliability‐based traffic assignment problem
An efficient solution algorithm for solving multi‐class reliability‐based traffic assignment problem
2011,
The multi‐class reliability‐based user equilibrium (RUE) problem has...
Ship routing and scheduling with cargo coupling and synchronization constraints
Ship routing and scheduling with cargo coupling and synchronization constraints
2011,
The purpose of this paper is to introduce and solve a planning problem faced by...
A Quadratic Algorithm for Finding Next‐to‐Shortest Paths in Graphs
A Quadratic Algorithm for Finding Next‐to‐Shortest Paths in Graphs
2011,
Given an edge‐weighted undirected graph G and two prescribed vertices u and v ,...
Applications of meta-heuristics to traffic engineering in IP networks
Applications of meta-heuristics to traffic engineering in IP networks
2011,
Intra-domain routing protocols are based on shortest path first (SPF) routing, where...
A concurrent solution for intra‐cell flow path layouts and I/O point locations of cells in a cellular manufacturing system
A concurrent solution for intra‐cell flow path layouts and I/O point locations of cells in a cellular manufacturing system
2011,
In this paper, we study the I/O (Input/Output) point location problem and the...
On Bounded Leg Shortest Paths Problems
On Bounded Leg Shortest Paths Problems
2011,
Let V be a set of points in a d ‐dimensional l p ‐metric space. Let s ,...
All‐Pairs Bottleneck Paths in Vertex Weighted Graphs
All‐Pairs Bottleneck Paths in Vertex Weighted Graphs
2011,
Let G =( V , E , w ) be a directed graph, where w : V →ℝ is a weight...
An Integer Programming Algorithm for Routing Optimization in IP Networks
An Integer Programming Algorithm for Routing Optimization in IP Networks
2011,
Most data networks nowadays use shortest path protocols to route the traffic. Given...
Information Collection on a Graph
Information Collection on a Graph
2011,
We derive a knowledge gradient policy for an optimal learning problem on a graph, in...
Point-to-point shortest paths on dynamic time-dependent road networks
Point-to-point shortest paths on dynamic time-dependent road networks
2010,
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste...
Optimizing RFID tag-inventorying algorithms
Optimizing RFID tag-inventorying algorithms
2010,
Maximizing the rate at which Radio Frequency IDentification (RFID) tags can be read is...
Papers per page: