On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
From MaRDI portal
Publication:1759867
DOI10.1016/j.dam.2012.07.020zbMath1262.90143OpenAlexW2133331715MaRDI QIDQ1759867
Pierre Hansen, Leo Liberti, Alberto L. C. Costa
Publication date: 22 November 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.07.020
Related Items
Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium, Minimal surface convex hulls of spheres, Divisive heuristic for modularity density maximization, GLOMIQO: global mixed-integer quadratic optimizer, Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming, Finding Symmetry Groups of Some Quadratic Programming Problems, Valid constraints for the Point Packing in a Square problem, Complete mixed integer linear programming formulations for modularity density based clustering, Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition, Packing Unit Spheres into a Cube Using VNS, Modified modularity density maximization and density ratio heuristic
Uses Software
