称球的整数规划问题

A Problem of Integer Programming for Classifying Balls

分而治之算法是数据结构中解决最大最小问题、排序问题的有效算法之一 .它能够对一个问题很快地设计一种计算步骤进行计算从而解决问题 ,但是对于解决这些问题所需最少操作数这个问题 ,它并不能给出实质的解答 .该文考察分而治之算法应用的一个问题并将它一般化 ,通过分析对这种更一般问题建立了求解该问题所需最少操作数的整数规划模型 ,通过求解该模型 。

Dividing and ruling is an effect algorithm in solving maxminmum and sorting problems. It can effectively generate a computation procedure but can not provide the number of operations it needs to solve such a problem. This article considers a problem to which dividing and ruling algorithm applies, and then generalizes the problem. By analysing the more general problem this article constructs an integer programming model for solving the least operation numbers.