On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics

DOI10.14529/MMP230302MaRDI QIDQ6153045zbMATH OpenOpenAlexFDO

Authors A. G. Chentsov, A. A. Chentsov, A. N. Sesekin

Publication date 13 February 2024

Published in Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software" (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingconstraint systemmovement routing

Mathematics Subject Classification ID

Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06)

Recommendations

• Minimax routing problem with a system of priority tasks
• The routing bottlenecks problem (optimization within zones)
• A bottleneck routing problem with a system of priority tasks
• Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
• A model of nonadditive routing problem where the costs depend on the set of pending tasks

Cites work

• 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?)
• A Dynamic Programming Approach to Sequencing Problems
• Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
• An Algorithm for the Traveling Salesman Problem
• Dynamic Programming Treatment of the Travelling Salesman Problem
• 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
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• Routing of displacements with dynamic constraints: ``bottleneck problem
• The traveling salesman problem and its variations
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• To question of routing of works complexes

Cited in

(2)

• The routing bottlenecks problem (optimization within zones)
• Minimax routing problem with a system of priority tasks

This page was built for publication: On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics

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