The relation of time indexed formulations of single machine scheduling problems to the node packing problem (Q1396279)

From MaRDI portal
Revision as of 21:15, 19 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
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
scientific article

    Statements

    The relation of time indexed formulations of single machine scheduling problems to the node packing problem (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2003
    0 references
    0 references
    nonpreemptive single machine scheduling
    0 references
    node packing
    0 references
    polyhedral methods
    0 references
    facet defining graphs
    0 references
    lifted valid inequalities
    0 references
    facet inducing inequalities
    0 references
    0 references