On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs

DOI10.1134/S0005117912030113zbMath1307.90192MaRDI QIDQ2261746

A. G. Chentsov

Publication date: 13 March 2015

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (12)

Route problem with constraints depending on a list of tasks ⋮ Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints ⋮ On sequential traversal of sets ⋮ Dynamic programming in the routing problem with constraints and costs depending on a list of tasks ⋮ Optimizing multi-inserts in routing problems with constraints ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ Elements of dynamic programming in extremal routing problems ⋮ Routing under constraints: problem of visit to megalopolises ⋮ Generalized Model of Courier with Additional Restrictions ⋮ On one routing problem modeling movement in radiation fields ⋮ Dynamic programming in the generalized bottleneck problem and the start point optimization ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding

Cites Work

• Extremal bottleneck routing problem with constraints in the form of precedence conditions
• The traveling salesman problem. I: Theoretical issues
• Hybrid control systems and the dynamic traveling salesman problem
• An extremal constrained routing problem with internal losses

This page was built for publication: On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs