Efficient algorithms for the routing open shop with unrelated travel times on cacti (Q1982880)
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: Efficient algorithms for the routing open shop with unrelated travel times on cacti |
scientific article; zbMATH DE number 7395320
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the routing open shop with unrelated travel times on cacti |
scientific article; zbMATH DE number 7395320 |
Statements
Efficient algorithms for the routing open shop with unrelated travel times on cacti (English)
0 references
14 September 2021
0 references
routing open shop
0 references
unrelated travel times
0 references
instance reduction
0 references
polynomially solvable subcase
0 references
optima localization
0 references
