The estimation of the number of OE-chains and realizable OE-routes for cutting plans with combined contours

DOI10.2298/YJOR191024025MzbMath1474.90383MaRDI QIDQ3388845

Egor Savitsky, Tatiana Makarovskikh

Publication date: 7 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

enumerationrouting problemcuttingordered enclosingcut realizationpierce point placementtechnological restrictions

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Chain sequences with ordered enclosing
• 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
• Constructing of OE-Postman Path for a Planar Graph
• About Routing in the Sheet Cutting
• Solving a Routing Problem with the Aid of an Independent Computations Scheme

This page was built for publication: The estimation of the number of OE-chains and realizable OE-routes for cutting plans with combined contours