Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701)

From MaRDI portal
Revision as of 22:42, 12 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
Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
scientific article

    Statements

    Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    0 references
    location-allocation
    0 references
    transportation
    0 references
    branch and bound
    0 references
    beam search
    0 references
    0 references
    0 references
    0 references