Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
From MaRDI portal
Publication:4018161
DOI10.1057/jors.1992.101zbMath0757.90055OpenAlexW2085774108MaRDI 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
Linear programming (90C05) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A simulated annealing approach for the circular cutting problem, A search strategy for the one-size assortment problem, A population heuristic for constrained two-dimensional non-guillotine cutting, Procedures for solving a 1-dimensional cutting problem, A hybrid evolutionary algorithm for the two-dimensional packing problem, An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry, A simulated annealing approach to the nesting problem in the textile manufacturing industry, The nesting problem in the leather manufacturing industry, Bin packing and cutting stock problems: mathematical models and exact algorithms, 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, Complete and robust no-fit polygon generation for the irregular stock cutting problem, A multi-objective programming approach to 1.5-dimensional assortment problem, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, Optimization of roll cutting in clothing industry, An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock, Simplest optimal cutting patterns for equal rectangles, The constrained compartmentalised knapsack problem, Heuristics for the integer one-dimensional cutting stock problem: A computational study, 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, Bun splitting: a practical cutting stock problem, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, Tight approximation algorithms for geometric bin packing with skewed items, An introduction to the two‐dimensional rectangular cutting and packing problem, A cutting stock problem in the wood products industry: a two‐stage solution approach, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority, Nested \((2,3)\)-instances of the cutting stock problem, The cutting stock problem in a hardboard industry: A case study., Exact algorithms for the guillotine strip cutting/packing problem., Model development and solver demonstrations using randomized test problems, Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem, Pattern minimisation in cutting stock problems, A note on ``Reducing the number of binary variables in cutting stock problems, Cutting and Packing Problems with Placement Constraints, An enumeration scheme to generate constrained exact checkerboard patterns, An exact model for a slitting problem in the steel industry, BPPLIB: a library for bin packing and cutting stock problems, An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem, Packing problems, 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, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems, Translational packing of arbitrary polytopes, Sensitive Instances of the Cutting Stock Problem, A hybrid approach for optimization of one-dimensional cutting, 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, Linear models for 1-group two-dimensional guillotine cutting problems, 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, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, Computing closely matching upper and lower bounds on textile nesting problems, 4-block heuristic for the rectangle packing problem, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, Mathematical modeling and optimal blank generation in glass manufacturing, Densest translational lattice packing of non-convex polygons, Evaluation of algorithms for one-dimensional cutting, The one-dimensional cutting stock problem with usable leftovers -- a survey
Uses Software
