Solving large airline crew scheduling problems: Random pairing generation and strong branching (Q5946770)

From MaRDI portal
Revision as of 00:52, 22 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1659648
Language Label Description Also known as
English
Solving large airline crew scheduling problems: Random pairing generation and strong branching
scientific article; zbMATH DE number 1659648

    Statements

    Solving large airline crew scheduling problems: Random pairing generation and strong branching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 April 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    transportation
    0 references
    branch and bound
    0 references
    airline crew scheduling
    0 references
    random pairing
    0 references
    linear programming relaxation
    0 references
    integer program
    0 references
    linear programming based heuristic
    0 references