A branch-and-cut algorithm for factory crane scheduling problem (Q897052): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10898-015-0285-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-015-0285-4 / rank | |||
Normal rank | |||
Latest revision as of 07:37, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for factory crane scheduling problem |
scientific article |
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
