A tutorial in irregular shape packing problems

From MaRDI portal
Revision as of 18:05, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3394054


DOI10.1057/jors.2008.169zbMath1168.90300MaRDI QIDQ3394054

Julia A. Bennell, José Fernando Oliveira

Publication date: 28 August 2009

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

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


90C59: Approximation methods and heuristics in mathematical programming

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming


Related Items

Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting, Heuristics for the two-dimensional irregular bin packing problem with limited rotations, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects, An effective heuristic for the two-dimensional irregular bin packing problem, A clique covering MIP model for the irregular strip packing problem, Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers, A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems, Matheuristics for the irregular bin packing problem with free rotations, A beam search approach to solve the convex irregular bin packing problem with guillotine guts, Optimal clustering of a pair of irregular objects, Exact solution techniques for two-dimensional cutting and packing, Optimized filling of a given cuboid with spherical powders for additive manufacturing, Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes, Irreducible bin packing and normality in routing open shop, A fully general, exact algorithm for nesting irregular shapes, Irregular packing problems: a review of mathematical models, A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem, Raster penetration map applied to the irregular packing problem, Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints, A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering, An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, Packing convex polygons in minimum-perimeter convex hulls, Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry, Packing Problems in Space Solved by CPLEX: An Experimental Analysis


Uses Software