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

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-002-0335-9 / rank
Normal rank
 
Property / author
 
Property / author: Hamish Waterer / rank
Normal rank
 
Property / author
 
Property / author: Q586310 / rank
Normal rank
 
Property / author
 
Property / author: Savelsbergh, Martin W. P. / rank
Normal rank
 
Property / author
 
Property / author: Hamish Waterer / rank
 
Normal rank
Property / author
 
Property / author: Ellis L. Johnson / rank
 
Normal rank
Property / author
 
Property / author: Savelsbergh, Martin W. P. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-002-0335-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059970089 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-002-0335-9 / rank
 
Normal rank

Latest revision as of 19:22, 10 December 2024

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
    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

    Identifiers