Mathematical models and routing algorithms for CAD technological preparation of cutting processes
From MaRDI portal
Publication:2399751
DOI10.1134/S0005117917050095zbMath1368.93021OpenAlexW2617318138MaRDI QIDQ2399751
A. V. Panyukov, E. A. Savitskiy, T. A. Makarovskikh
Publication date: 24 August 2017
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117917050095
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Mathematical models and routing algorithms for CAD technological preparation of cutting processes ⋮ Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes ⋮ Modeling and solving the endpoint cutting problem ⋮ The estimation of the number of OE-chains and realizable OE-routes for cutting plans with combined contours
Cites Work
- Chain sequences with ordered enclosing
- Local search of orthogonal packings using the lower bounds
- Eulerian graphs and related topics. Part 1, Volume 2
- Mathematical models and routing algorithms for CAD technological preparation of cutting processes
- On crossings, the Crossing Postman Problem, and the Rural Postman Problem
- Eulerian Cover with Ordered Enclosing for Flat Graphs
- Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Mathematical models and routing algorithms for CAD technological preparation of cutting processes