Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7605941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems |
scientific article; zbMATH DE number 7605941 |
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
0.8386722803115845
0 references
0.8337453603744507
0 references
0.8104715347290039
0 references
0.7741895318031311
0 references
