TOPOS

swMATH2206MaRDI QIDQ14750

No author found.

Described by source

• TOPOS -- A new constructive algorithm for nesting problems

Related Items (43)

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

This page was built for software: TOPOS