A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning

<div>The base cube is colored red; the global optimum is blue. There is no way to move from the red cube to the blue one without losing touch with the base cube.</div>

Journal of Applied Mathematics

fig1

Figure 1

Figure 1: A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning 