The relation of time indexed formulations of single machine scheduling problems to the node packing problem (Q1396279): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:58, 31 January 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
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
