A bottleneck routing problem with a system of priority tasks

DOI10.35634/2226-3594-2023-61-09MaRDI QIDQ6169144zbMATH OpenFDO

Authors A. G. Chentsov

Publication date 10 August 2023

Published in Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/iimi447

zbMATH Keywords

dynamic programmingminimax routing problemprecedence conditions

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Dynamic programming (90C39)

Recommendations

• A model of nonadditive routing problem where the costs depend on the set of pending tasks
• On a bottleneck routing problem
• Routing under constraints: problem of visit to megalopolises
• Problem of successive megalopolis traversal with the precedence conditions
• Routing of displacements with dynamic constraints: ``bottleneck problem

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
• Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
• Dynamic programming in the generalized bottleneck problem and the start point optimization
• Dynamic programming in the routing problem: decomposition variant
• Dynamic Programming Treatment of the Travelling Salesman Problem
• scientific article; zbMATH DE number 3648418 (Why is no real title available?)
• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3324725 (Why is no real title available?)
• scientific article; zbMATH DE number 3400017 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• On One Routing Problem with Non-Additive Cost Aggregation
• Routing of displacements with dynamic constraints: ``bottleneck problem
• The traveling salesman problem and its variations.
• The traveling salesman problem. I: Theoretical issues

Cited in

(8)

• A system for priority routing and capacity assignment in packet switched networks
• A model of nonadditive routing problem where the costs depend on the set of pending tasks
• Minimax routing problem with a system of priority tasks
• On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
• The routing bottlenecks problem (optimization within zones)
• Dynamic programming and decomposition in extreme routing problems
• Optimal trajectory for monitoring objects with obstacles
• Some constructions for solving routing problems using decompositions and transformations of target sets

This page was built for publication: A bottleneck routing problem with a system of priority tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169144)