Improved lower bounds and exact algorithm for the capacitated arc routing problem

This publication has 30 references indexed in Scilit:

• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
  INFORMS Journal on Computing, 2012
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
  Operations Research, 2011
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
  Mathematical Programming, 2007
• Exact methods based on node‐routing formulations for undirected arc‐routing problems
  Networks, 2005
• Exact solution of the generalized routing problem through graph transformations
  Journal of the Operational Research Society, 2003
• A guided local search heuristic for the capacitated arc routing problem
  European Journal of Operational Research, 2003
• A cutting plane algorithm for the capacitated arc routing problem
  Computers & Operations Research, 2003
• The Capacitated Arc Routing Problem: Valid Inequalities and Facets
  Computational Optimization and Applications, 1998
• Chapter 5 Arc routing methods and applications
  1995
• The Capacitated Arc Routing Problem: Lower bounds
  Networks, 1992