A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
type: Item
instance of: scholarly article
title: A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
zbMATH Open document ID: 1089.90045
DOI: 10.1137/S1052623403425617
author: Mihály Csaba Markót
author: Tibor Csendes
published in: SIAM Journal on Optimization
publication date: 2005-09-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 52C26
Mathematics Subject Classification ID: 65G30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 2206234
zbMATH Keywords: interval arithmetic
zbMATH Keywords: branch-and-bound method
zbMATH Keywords: circle packing
zbMATH Keywords: optimality proof
MaRDI profile type: Publication
full work available at URL: s1052623403425617
OpenAlex ID: W2023493235
Recommended article: An interval method to validate optimal solutions of the ``packing circles in a unit square'' problems
Recommended article: Interval methods for verifying structural optimality of circle packing configurations in the unit square
Recommended article: Improved interval methods for solving circle packing problems in the unit square
Recommended article: Packing equal circles in a square: A deterministic global optimization approach
Recommended article: Some new structures for the ``equal circles packing in a square'' problem
Recommended article: Q4530412
Recommended article: An inequality for circle packings proved by semidefinite programming
Recommended article: Q3139116
Recommended article: Techniques and results on approximation algorithms for packing circles
Recommended article: Optimal packing of 28 equal circles in a unit square -- the first reliable solution
description: scientific article; zbMATH DE number 2206234