𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch and bound algorithm for the capacitated vehicle routing problem

✍ Scribed by G. Laporte; Y. Nobert

Publisher
Springer
Year
1983
Tongue
German
Weight
643 KB
Volume
5
Category
Article
ISSN
0171-6468

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel branch and cut for capacitated
Parallel branch and cut for capacitated vehicle routing
✍ T.K. Ralphs πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 245 KB

Combinatorial optimization problems arise commonly in logistics applications. The most successful approaches to date for solving such problems involve modeling them as integer programs and then applying some variant of the branch and bound algorithm. Although branch and bound is conceptually easy to

An exact algorithm for the asymmetrical
An exact algorithm for the asymmetrical capacitated vehicle routing problem
✍ Gilbert Laporte; HΓ©lΓ¨ne Mercure; Yves Nobert πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 619 KB

The aim of this article is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e., the multiple traveling salesman problem subject to capacity restrictions. The problem is solved by means of a branch and bound tree in which subproblems are modified assignment pr