Sciweavers

599 search results - page 70 / 120
» The traveling salesman problem
Sort
View
ANOR
2006
64views more  ANOR 2006»
13 years 8 months ago
A note on asymptotic formulae for one-dimensional network flow problems
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Carlos F. Daganzo, Karen R. Smilowitz
CORR
2011
Springer
239views Education» more  CORR 2011»
12 years 11 months ago
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
Imen Harbaoui Dridi, Ryan Kammarti, Pierre Borne, ...
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 6 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
TRANSCI
2010
104views more  TRANSCI 2010»
13 years 2 months ago
Equilibrium Results for Dynamic Congestion Games
Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the...
Frédéric Meunier, Nicolas Wagner
COMGEO
2008
ACM
13 years 8 months ago
Optimal location of transportation devices
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
Jean Cardinal, Sébastien Collette, Ferran H...