On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks

DOI10.1134/S0081543821060067zbMath1484.90133OpenAlexW4205303497MaRDI QIDQ2071605

Yanyan Li

Publication date: 28 January 2022

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543821060067

zbMATH Keywords

dynamic programmingBellman function

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Dynamic programming (90C39)

Related Items (1)

One task of routing jobs in high radiation conditions

Cites Work

• Route problem with constraints depending on a list of tasks
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• The traveling salesman problem and its variations
• Adaptive nonlinear tool path optimization for five-axis machining
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
• The routing problems with optimization of the starting point: dynamic programming
• Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
• An Algorithm for the Traveling Salesman Problem
• In Pursuit of the Traveling Salesman
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks