The nesting problem in the leather manufacturing industry
From MaRDI portal
Publication:1897382
DOI10.1007/BF02099695zbMath0831.90063OpenAlexW2070487652MaRDI QIDQ1897382
Jörg Heistermann, Thomas Lengauer
Publication date: 27 August 1995
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02099695
Applications of mathematical programming (90C90) Production models (90B30) Combinatorial optimization (90C27)
Related Items
A simulated annealing approach to the nesting problem in the textile manufacturing industry, Fast neighborhood search for two- and three-dimensional nesting problems, Algorithms for nesting with defects, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, A variable neighborhood search algorithm for the leather nesting problem, Translational packing of arbitrary polytopes, Optimal placement of convex polygons to maximize point containment, Computing closely matching upper and lower bounds on textile nesting problems, A new variant of a vehicle routing problem: Lower and upper bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average-case analysis of cutting and packing in two dimensions
- Expected performance of the shelf heuristic for 2-dimensional packing
- A 2.5 times optimal algorithm for packing in two dimensions
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- Optimal packing and covering in the plane are NP-complete
- Lower bounds for on-line two-dimensional packing algorithms
- Packing problems
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- The cutting stock problem in the canvas industry
- An LP-based approach to cutting stock problems with multiple objectives
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Shelf Algorithms for Two-Dimensional Packing Problems
- Dynamic, first-fit packings in two or more dimensions
- Two-Dimensional Finite Bin-Packing Algorithms
- An approach to two-dimensional cutting stock problems
- Two-dimensional packing: expected performance of simple level algorithms
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- A algorithm for two-dimensional packing
- On Packing Two-Dimensional Bins
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- On random sequential packing in two and three dimensions
- An Algorithm for Two-Dimensional Cutting Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- A Multistage Solution of the Template-Layout Problem
