A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208)
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 1829906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cutting plane algorithm for the unrelated parallel machine scheduling problem |
scientific article; zbMATH DE number 1829906 |
Statements
A cutting plane algorithm for the unrelated parallel machine scheduling problem (English)
0 references
17 November 2002
0 references
Combinatorial optimization
0 references
Polyhedral combinatorics
0 references
Scheduling
0 references
0 references
0 references
0 references
0 references
0.8606641888618469
0 references
0.859539270401001
0 references
0.8515204787254333
0 references
0.8382983207702637
0 references
0.8298919796943665
0 references
