New bounds and algorithms for the transshipment yard scheduling problem (Q2434300)

From MaRDI portal
Revision as of 08:32, 7 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
New bounds and algorithms for the transshipment yard scheduling problem
scientific article

    Statements

    New bounds and algorithms for the transshipment yard scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    railway systems
    0 references
    transshipment yard
    0 references
    train scheduling
    0 references
    branch-and-bound
    0 references
    ejection chain
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references