𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of the k-customer vehicle routing problem

✍ Scribed by Refael Hassin; Shlomi Rubinstein

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
209 KB
Volume
33
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the vehicle routing problem
On the vehicle routing problem
✍ N.R. Achuthan; L. Caccetta; S.P. Hill πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 648 KB
Two exact algorithms for the vehicle rou
Two exact algorithms for the vehicle routing problem on trees
✍ Pontien Mbaraga; AndrΓ© Langevin; Gilbert Laporte πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 80 KB πŸ‘ 2 views

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The othe

On the complexity of the k-chain subgrap
On the complexity of the k-chain subgraph cover problem
✍ Yu Chang-Wu; Chen Gen-Huey; Ma Tze-Heng πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 776 KB

The k-chain subgraph cover problem asks if the edge set of a given bipartite graph G is the union of the edge sets of k chain graphs, where each chain graph is a subgraph of G. Although the X--chain subgraph cover problem is known to be NP-complete for the class of bipartite graphs, it is still unkn