A branch-and-cut procedure for the Udine course timetabling problem (Q1761891)

From MaRDI portal
Revision as of 09:10, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch-and-cut procedure for the Udine course timetabling problem
scientific article

    Statements

    title
    A branch-and-cut procedure for the Udine course timetabling problem (English)
    0 references
    author
    Jakub Mareček
    0 references
    Andrew J. Parkes
    0 references
    Edmund Kieran Burke
    0 references
    publication date
    15 November 2012
    0 references
    zbMATH Keywords
    integer programming
    0 references
    branch-and-cut
    0 references
    cutting planes
    0 references
    soft constraints
    0 references
    educational timetabling
    0 references
    university course timetabling
    0 references
    describes a project that uses
    CPLEX
    0 references
    Cliquer
    0 references
    cites work
    Q3056948
    0 references
    Q2934691
    0 references
    Q4033689
    0 references
    Q3002782
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C10
    0 references
    90C57
    0 references
    90B35
    0 references
    zbMATH DE Number
    6107402
    0 references
    OpenAlex ID
    W2010360426
    0 references
    Wikidata QID
    Q57968679
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1761891&oldid=38734093"
    Powered by MediaWiki