The relation of time indexed formulations of single machine scheduling problems to the node packing problem (Q1396279)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The relation of time indexed formulations of single machine scheduling problems to the node packing problem |
scientific article; zbMATH DE number 1942831
| 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; zbMATH DE number 1942831 |
Statements
The relation of time indexed formulations of single machine scheduling problems to the node packing problem (English)
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
