TOPOS

swMATH2206MaRDI QIDQ14750FDOQ14750

Author name not available (Why is that?)

Described by source

• TOPOS -- A new constructive algorithm for nesting problems

Cited In (43)

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

This page was built for software: TOPOS