The board packing problem

DOI10.1016/j.ejor.2023.01.030OpenAlexW4317358127MaRDI QIDQ6167668

Gyula Abraham, Tomas Attila Olaj, Zsolt Tuza, Lars Magnus Hvattum, György Dósa

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.01.030

zbMATH Keywords

coveringcombinatorial optimizationlocation problemsgenetic algorithmbinary integer programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• \(p\)-facility Huff location problem on networks
• The class cover problem with boxes
• Planar expropriation problem with non-rigid rectangular facilities
• Some simplified NP-complete graph problems
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
• Matheuristics for the irregular bin packing problem with free rotations
• A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation.
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A unified solution framework for multi-attribute vehicle routing problems
• An improved typology of cutting and packing problems
• Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
• On the Complexity of Some Common Geometric Location Problems
• The expropriation location problem
• On the rectangularp-center problem
• The generalized maximal covering location problem

This page was built for publication: The board packing problem