Cited in
(46)- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Exact approaches for the cutting path determination problem
- An effective heuristic for the two-dimensional irregular bin packing problem
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- Topological relations between three-dimensional periodic nets. I: Uninodal nets
- A cutting stock problem and its solution in the manufacturing industry of large electric generators
- A 2-exchange heuristic for nesting problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Irregular packing using the line and arc no-fit polygon
- An algorithm for polygon placement using a bottom-left strategy
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- Topological relations between three-periodic nets. II: Binodal nets
- A clique covering MIP model for the irregular strip packing problem
- Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- Algorithms for nesting with defects
- Solving the irregular strip packing problem via guided local search for overlap minimization
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- MIP-based heuristic for non-standard 3D-packing problems
- 2DCPackGen
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- A hybrid algorithm for constrained order packing
- Irregular packing: MILP model based on a polygonal enclosure
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
- Mathematical model and efficient algorithms for object packing problem
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- A beam search implementation for the irregular shape packing problem
- The irregular nesting problem: a new approach for nofit polygon calculation
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Heuristics for a dynamic rural postman problem
- Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle
- Dynamic programming algorithms for generating optimal strip layouts
- JNFP
- speedtest
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- A tutorial in irregular shape packing problems
- Raster penetration map applied to the irregular packing problem
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- A customized branch-and-bound approach for irregular shape nesting
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
This page was built for software: TOPOS
