A set covering based matheuristic for a real‐world city logistics problem (Q5246831)

From MaRDI portal
Revision as of 23:23, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6428815
Language Label Description Also known as
English
A set covering based matheuristic for a real‐world city logistics problem
scientific article; zbMATH DE number 6428815

    Statements

    title
    A set covering based matheuristic for a real‐world city logistics problem (English)
    0 references
    publication date
    22 April 2015
    0 references
    zbMATH Keywords
    matheuristics
    0 references
    set covering problem
    0 references
    dual ascent
    0 references
    Lagrangian relaxation
    0 references
    city logistics
    0 references
    describes a project that uses
    VRP
    0 references
    OR-Library
    0 references
    cites work

    Identifiers

    DOI
    10.1111/itor.12110
    0 references
    Mathematics Subject Classification ID
    90B06
    0 references
    90C59
    0 references
    90C27
    0 references
    zbMATH DE Number
    6428815
    0 references
    Wikidata QID
    Q59195715
    0 references
    OpenAlex ID
    W2041622750
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5246831&oldid=35450780"
    Powered by MediaWiki