A Scheme of Independent Calculations in a Precedence Constrained Routing Problem
- 10 September 2016
- book chapter
- Published by Springer Nature
- p. 121-135
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Route problem with constraints depending on a list of tasksDoklady Mathematics, 2015
- Elements of dynamic programming in extremal routing problemsAutomation and Remote Control, 2014
- Construction heuristics for generating tool paths for laser cuttersInternational Journal of Production Research, 2014
- An Optimized Algorithm of Numerical Cutting-Path Control in Garment ManufacturingAdvanced Materials Research, 2013
- Cutting path optimization in CNC cutting processes using a two-step genetic algorithmInternational Journal of Production Research, 2006
- Optimal process planning for a combined punch-and-laser cutting machine using ant colony optimizationInternational Journal of Production Research, 2005
- The Traveling Salesman Problem with Precedence ConstraintsOperations Research Proceedings, 1992
- On the complexity of dynamic programming for sequencing problems with precedence constraintsAnnals of Operations Research, 1990
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962
- Dynamic Programming Treatment of the Travelling Salesman ProblemJournal of the ACM, 1962