Pages that link to "Item:Q1127203"
From MaRDI portal
The following pages link to Solution approaches to irregular nesting problems (Q1127203):
Displayed 32 items.
- Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← 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)
- Cut scheduling in the apparel industry (Q883280) (← links)
- Heuristics for a dynamic rural postman problem (Q883291) (← links)
- Translational packing of arbitrary polytopes (Q1005325) (← links)
- Rotational polygon overlap minimization and compaction (Q1265289) (← links)
- Computing closely matching upper and lower bounds on textile nesting problems (Q1296780) (← links)
- A new algorithm for the two-polygon containment problem (Q1373882) (← links)
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon. (Q1592584) (← links)
- Densest translational lattice packing of non-convex polygons (Q1602949) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Alternative formulations for a layout problem in the fashion industry (Q1848631) (← links)
- A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems (Q1992380) (← links)
- Optimal clustering of a pair of irregular objects (Q2018508) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning (Q2242334) (← links)
- A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
- Mixed-integer programming models for nesting problems (Q2271127) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
- Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle (Q2508197) (← links)
- Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957) (← links)
- Covering Polygons with Rectangles (Q2988828) (← links)
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network (Q3163153) (← links)
- Solving nesting problems with non-convex polygons by constraint logic programming (Q4814103) (← links)
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints (Q5040957) (← links)
- An object-based evolutionary algorithm for solving nesting problems (Q5444463) (← links)
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)