2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem (Q2102848): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MENU-OKF / rank | |||
Normal rank | |||
Revision as of 20:02, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem |
scientific article |
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
