Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching (Q2631277)

From MaRDI portal
Revision as of 12:18, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching
scientific article

    Statements

    Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 July 2016
    0 references
    matheuristic
    0 references
    port yard optimization
    0 references
    granite block maritime transportation
    0 references

    Identifiers