A branch and cut heuristic for a runway scheduling problem (Q510289)

From MaRDI portal
Revision as of 10:10, 30 July 2024 by Openalex240730090724 (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 heuristic for a runway scheduling problem
scientific article

    Statements

    title
    A branch and cut heuristic for a runway scheduling problem (English)
    0 references
    publication date
    17 February 2017
    0 references
    zbMATH Keywords
    branch and cut
    0 references
    runway scheduling
    0 references
    author
    Pasquale Avella
    0 references
    Maurizio Boccia
    0 references
    cites work
    Q3115711
    0 references
    Integer Programming
    0 references
    Q4254875
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B35
    0 references
    90C10
    0 references
    90C57
    0 references
    90C59
    0 references
    zbMATH DE Number
    6685616
    0 references
    OpenAlex ID
    W2557163463
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q510289&oldid=37023631"
    Powered by MediaWiki