Pages that link to "Item:Q5438623"
From MaRDI portal
The following pages link to Cutting path optimization in CNC cutting processes using a two-step genetic algorithm (Q5438623):
Displaying 8 items.
- Routing under constraints: problem of visit to megalopolises (Q510285) (← links)
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks (Q2071605) (← links)
- Optimizing insertions in a constraint routing problem with complicated cost functions (Q2290475) (← links)
- Exact approaches for the cutting path determination problem (Q2329729) (← links)
- Mathematical models and routing algorithms for CAD technological preparation of cutting processes (Q2399751) (← links)
- Optimizing multi-inserts in routing problems with constraints (Q5114290) (← links)
- OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS (Q5125218) (← links)
- Two-stage dynamic programming in the routing problem with decomposition (Q6078066) (← links)
