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

DOI10.14529/mmp230302zbMath1530.90016OpenAlexW4388952056MaRDI QIDQ6153045

A. N. Sesekin, A. G. Chentsov, Alekseĭ Aleksandrovich Chentsov

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
• The traveling salesman problem and its variations
• To question of routing of works complexes
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Dynamic programming in the generalized bottleneck problem and the start point optimization
• Routing of displacements with dynamic constraints: “bottleneck problem”
• An Algorithm for the Traveling Salesman Problem
• Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
• In Pursuit of the Traveling Salesman

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