A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem (Q3391966)

From MaRDI portal
Revision as of 02:01, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
scientific article

    Statements

    A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2009
    0 references
    0 references
    0 references