A scheme of independent calculations in a precedence constrained routing problem

DOI10.1007/978-3-319-44914-2_10zbMATH Open1388.90016OpenAlexW2558180421MaRDI QIDQ3133206FDOQ3133206

Authors: A. G. Chentsov, Alexei Grigoriev 

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_10

Recommendations

• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• Solving a routing problem with the aid of an independent computations scheme
• Dynamic programming method in extremal constrained routing problems

zbMATH Keywords

dynamic programmingparallel algorithmsprecedence constraintsrouting problemsequential ordering problem

Mathematics Subject Classification ID

Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06)

Cited In (7)

• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding
• Solving a routing problem with the aid of an independent computations scheme
• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
• 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 scheme of independent calculations in a precedence constrained routing problem

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