Solving the close-enough arc routing problem (Q2811327)

From MaRDI portal
Revision as of 22:00, 16 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving the close-enough arc routing problem
scientific article

    Statements

    Solving the close-enough arc routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2016
    0 references
    close-enough arc routing problem
    0 references
    close-enough traveling salesman problem
    0 references
    automated meter Reading
    0 references
    radio frequency identification
    0 references
    branch-and-cut algorithm
    0 references

    Identifiers