Pages that link to "Item:Q960400"
From MaRDI portal
The following pages link to A beam search algorithm for the circular packing problem (Q960400):
Displaying 11 items.
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan (Q342431) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium (Q1618475) (← links)
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container (Q1651580) (← links)
- A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
- Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
