Jostling for position: local improvement for irregular cutting patterns
From MaRDI portal
Publication:3157715
DOI10.1057/palgrave.jors.2600563zbMath1131.90440OpenAlexW2069367205MaRDI QIDQ3157715
Kathryn A. Dowsland, Julia A. Bennell, William B. Dowsland
Publication date: 19 January 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600563
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming, Fast neighborhood search for two- and three-dimensional nesting problems, Complete and robust no-fit polygon generation for the irregular stock cutting problem, A clique covering MIP model for the irregular strip packing problem, An effective heuristic for the two-dimensional irregular bin packing problem, Solution approaches to irregular nesting problems, Generalized hyper-heuristics for solving 2D regular and irregular packing problems, Algorithms for nesting with defects, A global optimization point of view to handle non-standard object packing problems, A beam search implementation for the irregular shape packing problem, Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem, Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem, Exact approaches for the cutting path determination problem, A 2-exchange heuristic for nesting problems, An algorithm for polygon placement using a bottom-left strategy, The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon., Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
