Strategies for LP-based solving a general class of scheduling problems (Q3468869)
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 4135696
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strategies for LP-based solving a general class of scheduling problems |
scientific article; zbMATH DE number 4135696 |
Statements
Strategies for LP-based solving a general class of scheduling problems (English)
0 references
1990
0 references
coefficient reduction
0 references
special ordered sets
0 references
scheduling
0 references
large-scale pure 0-1 model
0 references
branch-and-bound
0 references
0.7920371890068054
0 references
0.7883602976799011
0 references
0.7821771502494812
0 references
