The Bellmann insertions in route problems with constraints and complicated cost functions. II
From MaRDI portal
(Redirected from Publication:5364324)
Recommendations
- The Bellmann insertions in the route problem with constraints and complicated cost functions
- Optimizing insertions in a constraint routing problem with complicated cost functions
- Optimizing multi-inserts in routing problems with constraints
- A Class of Euclidean Routing Problems with General Route Cost Functions
- On an iterative procedure for solving a routing problem with constraints
- Some applications of optimization routing problems with additional constraints
- New inequalities for the general routing problem
- An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
- scientific article; zbMATH DE number 3892967
- Bounds and Heuristics for Capacitated Routing Problems
Cited in
(8)- Optimizing insertions in a constraint routing problem with complicated cost functions
- Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
- Local dynamic programming incuts in routing problems with restrictions
- About one route problem with interior works
- The Bellmann insertions in the route problem with constraints and complicated cost functions
- 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
This page was built for publication: The Bellmann insertions in route problems with constraints and complicated cost functions. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364324)
