2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem (Q2102848)
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: 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem |
scientific article; zbMATH DE number 7631943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem |
scientific article; zbMATH DE number 7631943 |
Statements
2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem (English)
0 references
12 December 2022
0 references
scheduling-location
0 references
approximation algorithms
0 references
uncertainty
0 references
robust optimization
0 references
lateness
0 references
0.8454485535621643
0 references
0.7649346590042114
0 references
0.7641919851303101
0 references
0.7599197626113892
0 references
