A polyhedral approach to single-machine scheduling problems. (Q1586211)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1528063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polyhedral approach to single-machine scheduling problems. |
scientific article; zbMATH DE number 1528063 |
Statements
A polyhedral approach to single-machine scheduling problems. (English)
0 references
12 November 2000
0 references
scheduling
0 references
polyhedral methods
0 references
facet inducing inequalities
0 references
separation
0 references
branch-and-cut
0 references
0.8821187615394592
0 references
0.8736348152160645
0 references
0.8582417964935303
0 references
0.8425730466842651
0 references
