A branch-and-cut algorithm for an assembly routing problem (Q2286876)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for an assembly routing problem |
scientific article |
Statements
A branch-and-cut algorithm for an assembly routing problem (English)
0 references
23 January 2020
0 references
logistics
0 references
assembly routing problem
0 references
valid inequalities
0 references
subtour elimination constraints separation
0 references
branch-and-cut
0 references
integrated production and routing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
