Reformulation descent applied to circle packing problems
From MaRDI portal
Recommendations
- Formulation Space Search for Circle Packing Problems
- Variable neighborhood formulation space search for circle packing
- A heuristic for the circle packing problem with a variety of containers
- New approaches to circle packing in a square. With program codes.
- Global optimization method for finding dense packings of equal circles in a circle
Cites work
- scientific article; zbMATH DE number 412253 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- A new adaptive multi-start technique for combinatorial global optimizations
- Dense packings of congruent circles in a circle
- Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
- Handbook of metaheuristics
- Large-scale linearly constrained optimization
- Modified barrier functions (theory and methods)
- Packing Cylinders into Cylindrical Containers
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
- Variable Neighborhood Search
- Variable neighborhood search
- Variable neighborhood search for the p-median
Cited in
(43)- A note on solving MINLP's using formulation space search
- PERM for solving circle packing problem
- Adaptive and restarting techniques-based algorithms for circular packing problems
- A dynamic adaptive local search algorithm for the circular packing problem
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Adaptive beam search lookahead algorithms for the circular packing problem
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Variable neighbourhood search: Methods and applications
- Iterated dynamic neighborhood search for packing equal circles on a sphere
- Variable neighborhood search: the power of change and simplicity
- Variable neighbourhood search: methods and applications
- Variable neighborhood formulation space search for circle packing
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- Reformulations in Mathematical Programming: Definitions and Systematics
- In memory of Professor Nenad Mladenović (1951--2022)
- Global optimization method for finding dense packings of equal circles in a circle
- Dense packing of congruent circles in free-form non-convex containers
- A probability collectives approach for multi-agent distributed and cooperative optimization with tolerance for agent failure
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Variable neighborhood search: basics and variants
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A literature review on circle and sphere packing problems: models and methodologies
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
- Formulation Space Search for Circle Packing Problems
- A heuristic for the circle packing problem with a variety of containers
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Variable space search for graph coloring
- A beam search algorithm for the circular packing problem
- Solving the problem of packing equal and unequal circles in a circular container
- Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]
- Evolutionary computation solutions to the circle packing problem
- Graph colouring approaches for a satellite range scheduling problem
- Spreading points using gradient and tabu
- Minimizing the object dimensions in circle and sphere packing problems
- A new local search for continuous location problems
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Variable neighbourhood search for bandwidth reduction
This page was built for publication: Reformulation descent applied to circle packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772872)
