Pages that link to "Item:Q1266576"
From MaRDI portal
The following pages link to On genetic algorithms for the packing of polygons (Q1266576):
Displaying 50 items.
- Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- An effective shaking procedure for 2D and 3D strip packing problems (Q336597) (← links)
- A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
- An exact strip packing algorithm based on canonical forms (Q339635) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- Methods for multi-objective optimization: an analysis (Q508908) (← links)
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
- A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899) (← links)
- Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory (Q857327) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- A beam search implementation for the irregular shape packing problem (Q964846) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
- Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem (Q1592734) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
- Dealing with nonregular shapes packing (Q1718651) (← links)
- A pseudo-parallel genetic algorithm integrating simulated annealing for stochastic location-inventory-routing problem with consideration of returns in e-commerce (Q1723412) (← links)
- Matheuristics for the irregular bin packing problem with free rotations (Q1751657) (← links)
- An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles (Q1806919) (← links)
- An algorithm for polygon placement using a bottom-left strategy (Q1847183) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem (Q1869488) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems (Q1988631) (← links)
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems (Q1992380) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899) (← links)
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing (Q2267317) (← links)
- Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
- Exact approaches for the cutting path determination problem (Q2329729) (← links)
- Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six (Q2337023) (← links)
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle (Q2338490) (← links)
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization (Q2427181) (← links)
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
- A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
- A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem (Q2449252) (← links)
- Design of rectangular packings using decoders of block structure (Q2457589) (← links)
