A discrete-continuous routing problem with precedence constraints

DOI10.1134/S0081543818020074zbMath1391.93120OpenAlexW2804619399MaRDI QIDQ721512

D. Kharzeev

Publication date: 19 July 2018

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

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

zbMATH Keywords

precedence constraintstrackroute

Mathematics Subject Classification ID

Control/observation systems in abstract spaces (93C25)

Related Items

A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane, OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Route problem with constraints depending on a list of tasks
• 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
• 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
• A Model of "Nonadditive" Routing Problem Where the Costs Depend on the Set of Pending Tasks
• Routing of displacements with dynamic constraints: “bottleneck problem”
• In Pursuit of the Traveling Salesman
• Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.