Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case (Q1296095)

From MaRDI portal
Revision as of 11:14, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case
scientific article

    Statements

    Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case (English)
    0 references
    0 references
    0 references
    10 September 2000
    0 references
    periodic scheduling
    0 references
    airplane scheduling
    0 references
    polynomial algorithms
    0 references
    assignment problem
    0 references

    Identifiers