Packing problems

DOI10.1016/0377-2217(92)90288-KzbMath0825.90355OpenAlexW4211218975MaRDI QIDQ1197916

Kathryn A. Dowsland, William B. Dowsland

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90288-k

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, A population heuristic for constrained two-dimensional non-guillotine cutting, Integrated container loading software for pulp and paper industry, Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, Integrated shipment dispatching and packing problems: a case study, Reel and sheet cutting at a paper mill, Constrained order packing: comparison of heuristic approaches for a new bin packing problem, A hybrid evolutionary algorithm for the two-dimensional packing problem, A lower bound for the non-oriented two-dimensional bin packing problem, The application of integer linear programming to the implementation of a graphical user interface: A new rectangular packing problem, A simulated annealing approach to the nesting problem in the textile manufacturing industry, The nesting problem in the leather manufacturing industry, Solving nesting problems with non-convex polygons by constraint logic programming, An effective hybrid algorithm for the problem of packing circles into a larger containing circle, Effective methods for a container packing operation, An effective shaking procedure for 2D and 3D strip packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A hybrid genetic algorithm for the two-dimensional single large object placement problem, An integrated cutting stock and sequencing problem, Optimising the cutting of wood fibre plates in the hardboard industry, Complete and robust no-fit polygon generation for the irregular stock cutting problem, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, Combined cutting stock and lot-sizing problem with pattern setup, A simple randomized algorithm for two-dimensional strip packing, Efficient heuristics for robot acquisition planning for a CIM system, Arc-flow model for the two-dimensional guillotine cutting stock problem, An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock, The constrained compartmentalised knapsack problem, Interactive procedures in large-scale two-dimensional cutting stock problems, Packing ovals in optimized regular polygons, A family of genetic algorithms for the pallet loading problem, Regular packing of congruent polygons on the rectangular sheet, Solution approaches to irregular nesting problems, An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems, Packing different-sized circles into a rectangular container, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing, An introduction to the two‐dimensional rectangular cutting and packing problem, A squeaky wheel optimisation methodology for two-dimensional strip packing, The cutting stock problem in a hardboard industry: A case study., Model development and solver demonstrations using randomized test problems, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, A mathematical modeling approach to optimize composite parts placement in autoclave, Managing uncertainty in orthopaedic trauma theatres., Characterization and modelling of guillotine constraints, Approximate algorithms for constrained circular cutting problems, Solving circle packing problems by global optimization: numerical results and industrial applications, A moment based metric for 2-D and 3-D packing, 2D Optimal Packing with Population Based Algorithms, Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement, A coupling cutting stock-lot sizing problem in the paper industry, An enumeration scheme to generate constrained exact checkerboard patterns, Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet, Layout optimisation for an installation port of an offshore wind farm, The load planning problem for double-stack intermodal trains, A least wasted first heuristic algorithm for the rectangular packing problem, Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost, A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem, Improved local search algorithms for the rectangle packing problem with general spatial costs, Applying spatial representation techniques to the container packing problem, A new heuristic recursive algorithm for the strip rectangular packing problem, Checkerboard pattern: proposals for its generation, New lower bounds for bin packing problems with conflicts, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems, The forgotten sons: warehousing systems for brick-and-mortar retail chains, Convex Cardinal Shape Composition, An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem, The maximum diversity assortment selection problem, A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm, Approximation algorithm for the oriented two-dimensional bin packing problem, An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles, A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem, Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem, A recursive exact algorithm for weighted two-dimensional cutting, Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach, Column enumeration based decomposition techniques for a class of non-convex MINLP problems, Cutting circles and polygons from area-minimizing rectangles, Linear models for 1-group two-dimensional guillotine cutting problems, Optimal aircraft load balancing, The pinwheel pattern and its application to the manufacturer's pallet-loading problem, Applying genetic algorithms and neural networks to the container loading problem, An efficient approach for the multi-pallet loading problem, New lower bounds for the three-dimensional finite bin packing problem, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting, A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming, An algorithm of global optimization for solving layout problems, Computing closely matching upper and lower bounds on textile nesting problems, Integrated defect detection and optimization for cross cutting of wooden boards, 4-block heuristic for the rectangle packing problem, Two-dimensional packing problems: a survey, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, 3-D container packing heuristics, An exact depth-first algorithm for the pallet loading problem, An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle, Densest translational lattice packing of non-convex polygons, The one-dimensional cutting stock problem with usable leftovers -- a survey

Cites Work