A Lower Bound for the Node, Edge, and Arc Routing Problem

The Node, Edge, and Arc Routtng Problem (NEARP) was defined by Prins and Bouchenoua in 20011. This problem generalizes the classical Capacltated Vehicle Routing Problem (CVRP), the Capacitated Arc Routing Problem (CARP), and the General Routing Problem. It captures important aspects of real-life routing...
- Authors
- Lukas Bach
- Geir Hasle
- Sanne Wøhlk
- Year
- 2012