On a bottleneck routing problem (Q643816)
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 5966616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a bottleneck routing problem |
scientific article; zbMATH DE number 5966616 |
Statements
On a bottleneck routing problem (English)
0 references
2 November 2011
0 references
The authors focus on an extremal routing problem with a criterion that has the sense of the greatest edge length of a polygonal line. The problem belongs to the class of optimal constrained travel routing under conditions when the quality criterion corresponds to the ``bottleneck problem'' and includes a combination of estimators that may depend on a list of tasks. An economical variant of the procedure is constructed based on the dynamic programming method.
0 references
routing
0 references
precedence conditions
0 references
0.8844975829124451
0 references
0.8602380156517029
0 references
0.8302318453788757
0 references
0.8197710514068604
0 references
0.8074687123298645
0 references
