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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 00:45, 5 March 2024

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