๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

ROUTE 2009: Recent advances in vehicle routing optimization

โœ Scribed by Oli B.G. Madsen; Stefan Ropke

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
211 KB
Volume
58
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Route 2005: Recent advances in vehicle r
Route 2005: Recent advances in vehicle routing optimization
โœ Daniele Vigo; Paolo Toth; Aristide Mingozzi ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 50 KB

ROUTE 2005 was the third edition of an International Workshop on Vehicle Routing, Intermodal Transportation, and related areas that took place at the University of Bologna Residential Center of Bertinoro, Italy, between June 23rd and June 26th, 2005. The previous editions of the workshop were held i

Advances in natural language call routin
Advances in natural language call routing
โœ Hong-Kwang J. Kuo; Olivier Siohan; Joseph P. Olive ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Institute of Electrical and Electronics Engineers ๐ŸŒ English โš– 179 KB

This paper describes Bell Labs' efforts in developing core technologies toward natural language call routing (NLCR) applications. NLCR refers to technology allowing callers of a call center to be automatically routed to their desired destination based on natural spoken responses to an open-ended pro

Finding Optimal Routings in Hamming Grap
Finding Optimal Routings in Hamming Graphs
โœ Tian Khoon Lim; Cheryl E. Praeger ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 191 KB

A routing R in a graph consists of a simple path p uv from u to v for each ordered pair of distinct vertices (u, v). We will call R optimal if all the paths p uv are shortest paths and if edges of the graph occur equally often in the paths of R. In 1994, Solรฉ gave a sufficient condition involving th