Local dynamic programming incuts in routing problems with restrictions
DOI10.20537/VM140204zbMATH Open1299.90284OpenAlexW2489345585MaRDI QIDQ2932448FDOQ2932448
Authors: A. A. Petunin, A. G. Chentsov, P. A. Chentsov 
Publication date: 1 December 2014
Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/vuu427
Recommendations
- About routing in the sheet cutting
- The Bellmann insertions in route problems with constraints and complicated cost functions. II
- Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
- Optimizing insertions in a constraint routing problem with complicated cost functions
- Routing under constraints: problem of visit to megalopolises
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cited In (6)
- About routing in the sheet cutting
- Optimizing multi-inserts in routing problems with constraints
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- 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
- On the question of the optimization of permutations in the problem with dynamic constraints
This page was built for publication: Local dynamic programming incuts in routing problems with restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2932448)
