A branch-and-cut algorithm for factory crane scheduling problem (Q897052)
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: A branch-and-cut algorithm for factory crane scheduling problem |
scientific article; zbMATH DE number 6521417
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for factory crane scheduling problem |
scientific article; zbMATH DE number 6521417 |
Statements
A branch-and-cut algorithm for factory crane scheduling problem (English)
0 references
16 December 2015
0 references
factory crane scheduling problem
0 references
integer linear programming model
0 references
branch-and-cut
0 references
valid inequalities
0 references
0 references
0 references
0 references
0 references
0.7862209677696228
0 references
0.7520517110824585
0 references
0.7483565807342529
0 references
0.7464430928230286
0 references
0.7432729005813599
0 references
