The laser-plotter beam routing problem

DOI10.1057/PALGRAVE.JORS.2601161MaRDI QIDQ4658482zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

productionarc routingrural postman problem

Mathematics Subject Classification ID

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

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

Cited in

(6)

• Modeling and solving the endpoint cutting problem
• Solving a vehicle routing problem with resource conflicts and makespan objective with an application in car body manufacturing
• A constructive heuristic for the undirected rural postman problem
• On approximate data reduction for the Rural Postman Problem: Theory and experiments
• Recent results on arc routing problems: an annotated bibliography
• Heuristics for a dynamic rural postman problem

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)