Irregular Packing Using the Line and Arc No-Fit Polygon
From MaRDI portal
Publication:3098287
DOI10.1287/opre.1090.0770zbMath1228.90092OpenAlexW2111661250WikidataQ59569487 ScholiaQ59569487MaRDI QIDQ3098287
G. Whitwell, Graham Kendall, R. S. R. Hellier, Edmund Kieran Burke
Publication date: 17 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1090.0770
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (14)
Quasi-phi-functions and optimal packing of ellipses ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ Parallel computing technologies for solving optimization problems of geometric design ⋮ Algorithms for nesting with defects ⋮ Phi-functions for 2D objects formed by line segments and circular arcs ⋮ Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting ⋮ Optimized Object Packings Using Quasi-Phi-Functions ⋮ Optimal clustering of a pair of irregular objects ⋮ Irregular packing problems: a review of mathematical models ⋮ A fast implementation for the 2D/3D box placement problem ⋮ A hybrid chaos firefly algorithm for three-dimensional irregular packing problem ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications ⋮ A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
Uses Software
This page was built for publication: Irregular Packing Using the Line and Arc No-Fit Polygon
