• Title of article

    New lower bound for the Capacitated Arc Routing Problem

  • Author/Authors

    Sanne Wohlk، نويسنده ,

  • Issue Information
    ماهنامه با شماره پیاپی سال 2006
  • Pages
    15
  • From page
    3458
  • To page
    3472
  • Abstract
    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.
  • Keywords
    Capacitated arc routing problem , Lower bounds
  • Journal title
    Computers and Operations Research
  • Serial Year
    2006
  • Journal title
    Computers and Operations Research
  • Record number

    928831

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=928831