Aarhus University Seal / Aarhus Universitets segl

New lower bound for the Capacitated Arc Routing Problem

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • Department of Business Studies
  • CORAL - Centre for Operations Research Applications in Logistics
We present a new lower bound, the Multiple Cuts Node Duplication Lower Bound, for the undirected Capacitated Arc Routing Problem.We prove that this new bound dominates the existing bounds for the problem. Computational results are also provided.
Original languageEnglish
JournalComputers & Operations Research
Pages (from-to)3458-3472
Publication statusPublished - 2006

See relations at Aarhus University Citationformats

ID: 10787