Circle Packing

This MIRO App is based on the cpack model from the GAMS Model library.

Given the unit circle (of radius 1), the goal is to find a set of identical size circles with an optimized (maximal) radius r so that all such circles are contained by the unit circle, in a non-overlapping arrangement.

Note that solvers will be provided with a trivial start point where the centers of all inner circles are placed on the x axis.

While local solvers may not improve the start point and declare it as local optimum, global solvers are usually able to find solutions better than the trivial start point.

select the QCP solver

Select the number of inner circles to be placed in the outer circle

choose a solver time limit in seconds

Define the relative optimality criterion for global solvers

Model status

GAMS output

Update

Import jobs

Job was discarded

Job was imported successfully

Access denied

The job was not found on GAMS Engine.

The maximum number of parallel downloads has been reached.

An unexpected error occurred. If this problem persists, please contact a system administrator.