A branch-and-cut algorithm for an assembly routing problem (Q2286876)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7156867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for an assembly routing problem |
scientific article; zbMATH DE number 7156867 |
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
0.7733174562454224
0 references
0.7701089978218079
0 references
0.7673042416572571
0 references
0.7635864019393921
0 references
0.757614254951477
0 references
