Pages that link to "Item:Q1772872"
From MaRDI portal
The following pages link to Reformulation descent applied to circle packing problems (Q1772872):
Displaying 41 items.
- A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
- Global optimization method for finding dense packings of equal circles in a circle (Q541690) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- A heuristic for the circle packing problem with a variety of containers (Q635155) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Corrigendum to ``Variable space search for graph coloring'' [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)] (Q1028098) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container (Q1651580) (← links)
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← 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)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
- Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches (Q2184044) (← links)
- A new local search for continuous location problems (Q2255938) (← links)
- Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
- Dense packing of congruent circles in free-form non-convex containers (Q2357688) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- Evolutionary computation solutions to the circle packing problem (Q2402110) (← links)
- A note on solving MINLP's using formulation space search (Q2448189) (← links)
- PERM for solving circle packing problem (Q2459405) (← links)
- Minimizing the object dimensions in circle and sphere packing problems (Q2468491) (← links)
- Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips (Q2655648) (← links)
- In memory of Professor Nenad Mladenović (1951--2022) (Q2677361) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← 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)
- Spreading points using gradient and tabu (Q6097431) (← links)
- Iterated dynamic neighborhood search for packing equal circles on a sphere (Q6164321) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container (Q6568430) (← links)
