On a bottleneck routing problem (Q643816): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Latest revision as of 14:12, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a bottleneck routing problem |
scientific article |
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
