Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
From MaRDI portal
Publication:4018161
DOI10.1057/jors.1992.101zbMath0757.90055MaRDI QIDQ4018161
Paul E. Sweeney, Elizabeth Ridenour Paternoster
Publication date: 16 January 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.101
90C05: Linear programming
90C27: Combinatorial optimization
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Linear models for 1-group two-dimensional guillotine cutting problems, Complete and robust no-fit polygon generation for the irregular stock cutting problem, A multi-objective programming approach to 1.5-dimensional assortment problem, Simplest optimal cutting patterns for equal rectangles, The constrained compartmentalised knapsack problem, Translational packing of arbitrary polytopes, The one-dimensional cutting stock problem with due dates, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, A sequential heuristic procedure for one-dimensional cutting, Compaction and separation algorithms for non-convex polygons and their applications, CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem, Packing problems, 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, Computing closely matching upper and lower bounds on textile nesting problems, 4-block heuristic for the rectangle packing problem, A search strategy for the one-size assortment problem, Procedures for solving a 1-dimensional cutting problem, Optimization of roll cutting in clothing industry, An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock, The cutting stock problem in a hardboard industry: A case study., Exact algorithms for the guillotine strip cutting/packing problem., Densest translational lattice packing of non-convex polygons, Evaluation of algorithms for one-dimensional cutting, A hybrid approach for optimization of one-dimensional cutting, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, A simulated annealing approach for the circular cutting problem, A population heuristic for constrained two-dimensional non-guillotine cutting, A simulated annealing approach to the nesting problem in the textile manufacturing industry, The nesting problem in the leather manufacturing industry, Heuristics for the integer one-dimensional cutting stock problem: A computational study, Pattern minimisation in cutting stock problems, An enumeration scheme to generate constrained exact checkerboard patterns, Adaptive and restarting techniques-based algorithms for circular packing problems, Strip generation algorithms for constrained two-dimensional two-staged cutting problems, Dynamic programming algorithms for the optimal cutting of equal rectangles, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, 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, Alternative configurations for cutting machines in a tube cutting mill, Optimising the cutting of wood fibre plates in the hardboard industry, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
Uses Software
