A discrete-continuous routing problem with precedence constraints

DOI10.1134/S0081543818020074MaRDI QIDQ721512zbMATH OpenOpenAlexFDO

Authors 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 constraintsroutetrack

Mathematics Subject Classification ID

Control/observation systems in abstract spaces (93C25)

Recommendations

• Constrained optimal routing
• Problem of successive megalopolis traversal with the precedence conditions
• A model of nonadditive routing problem where the costs depend on the set of pending tasks
• Optimization 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

• A model of nonadditive routing problem where the costs depend on the set of pending tasks
• Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
• Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.
• Elements of dynamic programming in extremal routing problems
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3972625 (Why is no real title available?)
• scientific article; zbMATH DE number 42114 (Why is no real title available?)
• scientific article; zbMATH DE number 3264065 (Why is no real title available?)
• scientific article; zbMATH DE number 3280851 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• Problem of successive megalopolis traversal with the precedence conditions
• Route problem with constraints depending on a list of tasks
• Routing of displacements with dynamic constraints: ``bottleneck problem
• The traveling salesman problem and its variations
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods

Cited in

(3)

• Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
• Constrained optimal routing
• A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane

This page was built for publication: A discrete-continuous routing problem with precedence constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721512)