Efficient approximation algorithms for the routing open shop problem (Q340238)
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 approximation algorithms for the routing open shop problem |
scientific article; zbMATH DE number 6652524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient approximation algorithms for the routing open shop problem |
scientific article; zbMATH DE number 6652524 |
Statements
Efficient approximation algorithms for the routing open shop problem (English)
0 references
14 November 2016
0 references
routing open shop
0 references
approximation algorithm
0 references
worst-case analysis
0 references
0.9759127497673036
0 references
0.9286026358604432
0 references
0.9247102737426758
0 references
0.9043246507644652
0 references
0.8991684317588806
0 references
