The following pages link to TOPOS (Q14750):
Displaying 43 items.
- Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
- A hybrid algorithm for constrained order packing (Q301159) (← links)
- An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming (Q819074) (← links)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- Heuristics for a dynamic rural postman problem (Q883291) (← links)
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet (Q948647) (← links)
- A beam search implementation for the irregular shape packing problem (Q964846) (← links)
- MIP-based heuristic for non-standard 3D-packing problems (Q1029557) (← links)
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem (Q1040080) (← links)
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon. (Q1592584) (← links)
- A review of the application of meta-heuristic algorithms to 2D strip packing problems (Q1604668) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- A customized branch-and-bound approach for irregular shape nesting (Q1668808) (← links)
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations (Q1756757) (← links)
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem (Q1762025) (← links)
- A cutting stock problem and its solution in the manufacturing industry of large electric generators (Q1777147) (← links)
- A 2-exchange heuristic for nesting problems (Q1847180) (← links)
- An algorithm for polygon placement using a bottom-left strategy (Q1847183) (← links)
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems (Q1992380) (← links)
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899) (← links)
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning (Q2242334) (← links)
- Mathematical model and efficient algorithms for object packing problem (Q2269838) (← links)
- Raster penetration map applied to the irregular packing problem (Q2312355) (← links)
- Exact approaches for the cutting path determination problem (Q2329729) (← links)
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
- Dynamic programming algorithms for generating optimal strip layouts (Q2506184) (← links)
- Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle (Q2508197) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry (Q2803270) (← links)
- Irregular Packing Using the Line and Arc No-Fit Polygon (Q3098287) (← links)
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network (Q3163153) (← links)
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem (Q3392005) (← links)
- A tutorial in irregular shape packing problems (Q3394054) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
- Topological relations between three-dimensional periodic nets. I. Uninodal nets (Q5359246) (← links)
- Topological relations between three-periodic nets. II. Binodal nets (Q5359287) (← links)
- The irregular nesting problem: a new approach for nofit polygon calculation (Q5429840) (← links)
- Cutting path optimization in CNC cutting processes using a two-step genetic algorithm (Q5438623) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713877) (← links)
