The laser-plotter beam routing problem

DOI10.1057/PALGRAVE.JORS.2601161zbMATH Open1181.90105OpenAlexW1991918457MaRDI QIDQ4658482FDOQ4658482

Gianpaolo Ghiani, Gennaro Improta

Publication date: 16 March 2005

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601161

Recommendations

• The algorithms for constructing of cutter optimal path
• Optimal control of plotting and drilling machines: A case study
• About routing in the sheet cutting
• Solving a vehicle routing problem with resource conflicts and makespan objective with an application in car body manufacturing
• scientific article; zbMATH DE number 956790

zbMATH Keywords

productionarc routingrural postman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Production models (90B30)

Cited In (5)

• A constructive heuristic for the undirected rural postman problem
• Modeling and solving the endpoint cutting problem
• On approximate data reduction for the Rural Postman Problem: Theory and experiments
• Heuristics for a dynamic rural postman problem
• Recent results on Arc Routing Problems: An annotated bibliography

This page was built for publication: The laser-plotter beam routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658482)