A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints (Q321126)
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 truck dock assignment problem with operational time constraints |
scientific article; zbMATH DE number 6635851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints |
scientific article; zbMATH DE number 6635851 |
Statements
A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints (English)
0 references
7 October 2016
0 references
truck dock assignment
0 references
polytope
0 references
dimension
0 references
valid inequalities
0 references
facet-defining inequalities
0 references
0 references
