An integer programming-based local search for the covering salesman problem (Q1761202)

From MaRDI portal
Revision as of 21:46, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An integer programming-based local search for the covering salesman problem
scientific article

    Statements

    title
    An integer programming-based local search for the covering salesman problem (English)
    0 references
    author
    Majid Salari
    0 references
    Zahra Naji-Azimi
    0 references
    publication date
    15 November 2012
    0 references
    Mathematics Subject Classification ID
    90C27
    0 references
    05C90
    0 references
    05C85
    0 references
    05C45
    0 references
    90C11
    0 references
    90C59
    0 references
    zbMATH DE Number
    6106614
    0 references
    zbMATH Keywords
    covering salesman problem
    0 references
    heuristics
    0 references
    integer linear programming
    0 references
    describes a project that uses
    TSPLIB
    0 references
    VRP
    0 references
    CPLEX
    0 references
    OpenAlex ID
    W2030714952
    0 references
    cites work
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1761202&oldid=35307755"
    Powered by MediaWiki