Pages that link to "Item:Q2643953"
From MaRDI portal
The following pages link to A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem (Q2643953):
Displaying 31 items.
- 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)
- Efficient implementations of construction heuristics for the rectilinear block packing problem (Q337284) (← links)
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
- A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
- Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
- A random key based genetic algorithm for the resource constrained project scheduling problem (Q947946) (← links)
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties (Q1017438) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- A review of the application of meta-heuristic algorithms to 2D strip packing problems (Q1604668) (← links)
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules (Q1652386) (← links)
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
- Fragmentary structures in discrete optimization problems (Q1699407) (← links)
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)
- A parallel multi-population biased random-key genetic algorithm for a container loading problem (Q1761962) (← links)
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles (Q1806919) (← links)
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem (Q1869488) (← links)
- Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems (Q1988631) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
- Fragmentary structures in a two-dimensional strip packing problem (Q2174049) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem (Q2654397) (← links)
- An efficient deterministic optimization approach for rectangular packing problems (Q2868912) (← links)
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
- A Modified Partially Mapped MultiCrossover Genetic Algorithm for Two-Dimensional Bin Packing Problem (Q3583088) (← links)
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (Q5058727) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
