Pages that link to "Item:Q5429303"
From MaRDI portal
The following pages link to Formulation Space Search for Circle Packing Problems (Q5429303):
Displayed 14 items.
- A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
- A heuristic for the circle packing problem with a variety of containers (Q635155) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- Less is more approach in optimization: a road to artificial intelligence (Q2070138) (← links)
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches (Q2184044) (← links)
- Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- Packing equal circles into a circle with circular prohibited areas (Q4903496) (← links)
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times (Q4987698) (← links)
- A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure (Q5023088) (← links)