Modeling and solving the endpoint cutting problem

DOI10.1111/itor.13091OpenAlexW4200189896MaRDI QIDQ6056164

Unnamed Author, Unnamed Author, Unnamed Author, Unnamed Author, Unnamed Author

Publication date: 29 September 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13091

zbMATH Keywords

GRASPmixed integer programming modelwarm-startendpoint cutting problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• A warm-start approach for large-scale stochastic linear programs
• Heuristics for a dynamic rural postman problem
• Greedy randomized adaptive search procedures
• A typology of cutting and packing problems
• Mathematical models and routing algorithms for CAD technological preparation of cutting processes
• An improved typology of cutting and packing problems
• A Linear Programming Approach to the Cutting-Stock Problem
• On the complexity of edge traversing
• The stacker crane problem and the directed general routing problem
• The laser-plotter beam routing problem
• Arc Routing Problems, Part II: The Rural Postman Problem

This page was built for publication: Modeling and solving the endpoint cutting problem