𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New lower bounds for the Capacitated Arc Routing Problem

✍ Scribed by Wen Lea Pearn

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
518 KB
Volume
18
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Edge assembly-based memetic algorithm fo
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
✍ Yuichi Nagata; Olli BrΓ€ysy πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 200 KB

## Abstract Vehicle routing problems are at the heart of most decision support systems for real‐life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e., fleet of vehicles) located at one or several points (e.g.,

A New Lower Bound for the Football Pool
A New Lower Bound for the Football Pool Problem for Six Matches
✍ Patric R.J. Γ–stergΓ₯rd; Alfred Wassermann πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 89 KB

In the football pool problem one wants to minimize the cardinality of a ternary code, C F n 3 ; with covering radius one, and the size of a minimum code is denoted by s n : The smallest unsettled case is 634s 6 473: The lower bound is here improved to 65 in a coordinate-by-coordinate backtrack searc