The nesting problem in the leather manufacturing industry
From MaRDI portal
Publication:1897382
Recommendations
Cites work
- A 2.5 times optimal algorithm for packing in two dimensions
- A algorithm for two-dimensional packing
- A Multistage Solution of the Template-Layout Problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- An Algorithm for Two-Dimensional Cutting Problems
- An approach to two-dimensional cutting stock problems
- An LP-based approach to cutting stock problems with multiple objectives
- Average-case analysis of cutting and packing in two dimensions
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Dynamic, first-fit packings in two or more dimensions
- Expected performance of the shelf heuristic for 2-dimensional packing
- scientific article; zbMATH DE number 437550 (Why is no real title available?)
- scientific article; zbMATH DE number 3891135 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4074379 (Why is no real title available?)
- Lower bounds for on-line two-dimensional packing algorithms
- Multistage Cutting Stock Problems of Two and More Dimensions
- On Packing Two-Dimensional Bins
- On random sequential packing in two and three dimensions
- Optimal packing and covering in the plane are NP-complete
- Orthogonal Packings in Two Dimensions
- Packing problems
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- Shelf Algorithms for Two-Dimensional Packing Problems
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- The cutting stock problem in the canvas industry
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-dimensional packing: expected performance of simple level algorithms
Cited in
(12)- Translational packing of arbitrary polytopes
- Nesting planning based on production priorities and technological efficiency
- 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
- A simulated annealing approach to the nesting problem in the textile manufacturing industry
- A variable neighborhood search algorithm for the leather nesting problem
- Fast neighborhood search for two- and three-dimensional nesting problems
- scientific article; zbMATH DE number 437550 (Why is no real title available?)
- Algorithms for nesting with defects
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- A parallel branch-and-bound-and-check algorithm for nesting
This page was built for publication: The nesting problem in the leather manufacturing industry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897382)
