On a bottleneck routing problem
From MaRDI portal
Publication:643816
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.
Recommendations
- Extremal bottleneck routing problem with constraints in the form of precedence conditions
- Routing of displacements with dynamic constraints: ``bottleneck problem
- Dynamic programming in the generalized bottleneck problem and the start point optimization
- A model of nonadditive routing problem where the costs depend on the set of pending tasks
- An extremal constrained routing problem with internal losses
Cited in
(18)- The dynamic bowser routing problem
- Approximation schemes for the generalized traveling salesman problem
- An extremal constrained routing problem with internal losses
- Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
- scientific article; zbMATH DE number 3848940 (Why is no real title available?)
- A model of nonadditive routing problem where the costs depend on the set of pending tasks
- Dynamic programming method in extremal constrained routing problems
- scientific article; zbMATH DE number 4051669 (Why is no real title available?)
- Elements of dynamic programming in extremal routing problems
- scientific article; zbMATH DE number 1874147 (Why is no real title available?)
- Dynamic programming in the generalized bottleneck problem and the start point optimization
- Routing of displacements with dynamic constraints: ``bottleneck problem
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
- Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
- A bottleneck routing problem with a system of priority tasks
- The routing bottlenecks problem (optimization within zones)
- Extremal bottleneck routing problem with constraints in the form of precedence conditions
- Evolutionary-fragmentary model of the routing problem
This page was built for publication: On a bottleneck routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643816)
