Pages that link to "Item:Q1876197"
From MaRDI portal
The following pages link to A simulated annealing approach for the circular cutting problem (Q1876197):
Displayed 15 items.
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818) (← links)
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- The antennas preassignment problem (Q1766595) (← links)
- A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
- Packing non-identical circles within a rectangle with open length (Q2392114) (← links)
- Valid constraints for the Point Packing in a Square problem (Q2446880) (← links)
- Packing unequal circles into a strip of minimal length with a jump algorithm (Q2448172) (← links)
- Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes (Q2464205) (← links)
- Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID (Q3114612) (← links)
- A model to design recreational boat mooring fields (Q3621925) (← links)