2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem (Q2102848): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: MENU-OKF / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.orl.2022.11.001 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4308738222 / rank | |||
Normal rank |
Latest revision as of 00:45, 20 March 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