A numerical proof by reliable Global Optimization for a problem of covering a rectangle with circles
Abstract
In this paper, we show how a reliable global Branch and Bound optimization method based on interval arithmetic can be used efficiently to numerically prove a conjecture in geometry about how to cover a rectangle by 6 circles of equal radius.
Origin : Files produced by the author(s)
Loading...