Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2022.09.026 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2022.09.026 / rank | |||
Normal rank | |||
Latest revision as of 00:39, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems |
scientific article |
Statements
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (English)
0 references
24 October 2022
0 references
combinatorial optimization
0 references
sensitivity analysis
0 references
bottleneck objective
0 references
linear bottleneck assignment problem
0 references
bottleneck spanning tree problem
0 references
0 references
0 references
0 references
0 references
