Temps d'attente dans les transports urbains en commun
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Page 1
Displaying 1 – 5 of 5
The inverse carrier problem
Grant B. Gustafson, Miroslav Laitoch (2002)
Czechoslovak Mathematical Journal
The problem was motivated by Borůvka’s definitions of the carrier and the associated carrier. The inverse carrier problem is precisely defined and partially solved. Examples are given.
The Procedure to Determine Microstate Probabilities in a Trunk Group Serving Overflow Traffic
Miodrag Bakmaz, Slobodan Lazović (1997)
The Yugoslav Journal of Operations Research
The vehicle routing problem
Nicos Christofides (1976)
RAIRO - Operations Research - Recherche Opérationnelle
Traffic plans.
Marc Bernot, Vicent Caselles, Jean-Michel Morel (2005)
Publicacions Matemàtiques
In recent research in the optimization of transportation networks, the problem was formalized as finding the optimal paths to transport a measure y+ onto a measure y- with the same mass. This approach is realistic for simple good distribution networks (water, electric power,. ..) but it is no more realistic when we want to specify who goes where, like in the mailing problem or the optimal urban traffic network problem. In this paper, we present a new framework generalizing the former approathes...
Currently displaying 1 – 5 of 5
Page 1