Construction of a technologically feasible cutting with pierce points placement constraints

DOI10.1007/978-3-030-65739-0_14OpenAlexW3125487858MaRDI QIDQ6130888

Tatiana Makarovskikh, A. V. Panyukov

Publication date: 3 April 2024

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-65739-0_14

zbMATH Keywords

polynomial algorithmrouting problemcuttingoptimal route

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Chain sequences with ordered enclosing
• Exact approaches for the cutting path determination problem
• Constructing of OE-Postman Path for a Planar Graph
• Solving a Routing Problem with the Aid of an Independent Computations Scheme
• Cutting path optimization in CNC cutting processes using a two-step genetic algorithm

This page was built for publication: Construction of a technologically feasible cutting with pierce points placement constraints