Route problem with constraints depending on a list of tasks

DOI10.1134/S1064562415060083zbMath1334.90139MaRDI QIDQ265955

F. Blanchet-Sadri, M. Dambrine

Publication date: 13 April 2016

Published in: Doklady Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (10)

A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) ⋮ Optimizing multi-inserts in routing problems with constraints ⋮ On the question of the optimization of permutations in the problem with dynamic constraints ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ On one routing task with the optimization of the start-finish point ⋮ A discrete-continuous routing problem with precedence constraints ⋮ Solving a Routing Problem with the Aid of an Independent Computations Scheme ⋮ On one routing problem modeling movement in radiation fields ⋮ Оptimization of the Start Point in the Gtsp with the Precedence Conditions ⋮ On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
• Elements of dynamic programming in extremal routing problems
• Problem of successive megalopolis traversal with the precedence conditions
• Constrained optimal routing
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem and its variations
• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs

This page was built for publication: Route problem with constraints depending on a list of tasks