Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
From MaRDI portal
Publication:5040957
Recommendations
- Routing under constraints: problem of visit to megalopolises
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
- scientific article; zbMATH DE number 3876922
- An application of optimal transport paths to urban transport networks
- Optimal routing in a transportation network
- A computationally efficient iterative solution of the multidestination optimal dynamic routing problem
- Optimal Dynamic Routing in Multidestination Networks
- Sequential search and its application to vehicle-routing problems
- Multiobjective routing problems
- Optimal schedules for problems with various routes
Cites work
- scientific article; zbMATH DE number 3648418 (Why is no real title available?)
- scientific article; zbMATH DE number 3163006 (Why is no real title available?)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- A memetic algorithm for the generalized traveling salesman problem
- A new generalization of the traveling salesman problem
- Approximability of the problem about a minimum-weight cycle cover of a graph
- Branch-and-bound for the precedence constrained generalized traveling salesman problem
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Hybrid optimization methods for time-dependent sequencing problems
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Routing under constraints: problem of visit to megalopolises
- Solution approaches to irregular nesting problems
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- The traveling salesman problem. I: Theoretical issues
- Time-dependent routing problems: a review
Cited in
(7)- On sequential traversal of sets
- About routing in the sheet cutting
- The routing problems with optimization of the starting point: dynamic programming
- Some applications of optimization routing problems with additional constraints
- Routing under constraints: problem of visit to megalopolises
- Two-stage dynamic programming in the routing problem with decomposition
- On the question of the optimization of permutations in the problem with dynamic constraints
This page was built for publication: Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5040957)
