A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal (Q3423263)
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 the quay crane scheduling problem in a container terminal |
scientific article; zbMATH DE number 5129160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal |
scientific article; zbMATH DE number 5129160 |
Statements
A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal (English)
0 references
20 February 2007
0 references
maritime container terminal
0 references
quay crane scheduling
0 references
branch-and-cut
0 references
0.93131447
0 references
0.92784846
0 references
0.9261415
0 references
0.92220896
0 references
0.9220634
0 references
0.9189792
0 references
0.9187641
0 references
0.9178462
0 references
