Multi-level dynamic programming in routing problems with constraints
From MaRDI portal
Cites work
- A Dynamic Programming Approach to Sequencing Problems
- Approximation schemes for the generalized traveling salesman problem
- Dynamic programming and decomposition in extreme routing problems
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Elements of dynamic programming in extremal routing problems
- Extremal routing problem with internal losses
- scientific article; zbMATH DE number 3163006 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 6315689 (Why is no real title available?)
- scientific article; zbMATH DE number 3400017 (Why is no real title available?)
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- New classes of efficiently solvable generalized traveling salesman problems
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- Problem of successive megalopolis traversal with the precedence conditions
- Procedures for travelling salesman problems with additional constraints
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Route problem with constraints depending on a list of tasks
- Routing under constraints: problem of visit to megalopolises
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
- The traveling salesman problem and its variations.
- To question of routing of works complexes
- Two-stage dynamic programming in the routing problem with decomposition
This page was built for publication: Multi-level dynamic programming in routing problems with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862941)
