The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697)

From MaRDI portal
Revision as of 00:27, 6 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
The team orienteering problem with time windows: an LP-based granular variable neighborhood search
scientific article

    Statements

    title
    The team orienteering problem with time windows: an LP-based granular variable neighborhood search (English)
    0 references
    author
    Nacima Labadie
    0 references
    Renata Mansini
    0 references
    Jan Melechovský
    0 references
    Roberto Wolfler Calvo
    0 references
    publication date
    29 December 2012
    0 references
    zbMATH Keywords
    team orienteering problem
    0 references
    time windows
    0 references
    variable neighborhood search
    0 references
    LP-based granularity
    0 references
    cites work
    Q4540081
    0 references
    Q4365135
    0 references
    Q2956989
    0 references

    Identifiers

    zbMATH DE Number
    6119332
    0 references
    OpenAlex ID
    W2058995871
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1926697&oldid=35314343"
    Powered by MediaWiki