Solving a Routing Problem with the Aid of an Independent Computations Scheme

DOI10.14529/mmp180106zbMath1409.90157OpenAlexW2801282736MaRDI QIDQ4692135

No author found.

Publication date: 26 October 2018

Published in: Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software" (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/vyuru418

zbMATH Keywords

dynamic programmingparallel computationsequencingprecedence constraintsroute

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (3)

Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes ⋮ Construction of a technologically feasible cutting with pierce points placement constraints ⋮ The estimation of the number of OE-chains and realizable OE-routes for cutting plans with combined contours

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Route problem with constraints depending on a list of tasks
• Routing under constraints: problem of visit to megalopolises
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• On the complexity of dynamic programming for sequencing problems with precedence constraints
• The traveling salesman problem and its variations
• Hybrid optimization methods for time-dependent sequencing problems
• To question of routing of works complexes
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• An Algorithm for the Traveling Salesman Problem
• In Pursuit of the Traveling Salesman

This page was built for publication: Solving a Routing Problem with the Aid of an Independent Computations Scheme