The Application of an Implicit Enumeration Algorithm to the School Desegregation Problem
The Application of an Implicit Enumeration Algorithm to the School Desegregation Problem
复制标题
隐式枚举算法在学校废除种族隔离问题中的应用
DOI：
10.1287/mnsc.20.2.159
复制
发表时间：
1973
影响因子：
5.4
通讯作者：
R. Liggett
中科院分区：
文献类型：
--
作者：
R. Liggett
本文提出了一种隐枚举算法来重绘学校出勤边界，以满足集成的要求。该方法的基础是将城市划分为与社区相对应的较小区域或区域。这些区域分配给学校，目的是尽量减少所需的巴士，同时满足学校的容量和种族组合的限制。整个地区被分配给一所学校，从而保留了邻里学校的概念。将可能的分区学校作业视为一个组合问题，将一般枚举过程与概率论相结合，形成隐枚举算法。解释的算法沿着与计算结果的方法应用到现有的学校系统。
This paper presents an implicit enumeration algorithm for redrawing school attendance boundaries in order to meet integration requirements. The basis of the approach is the division of the city into smaller areas or zones corresponding to neighborhoods. These zones are assigned to schools with the objective of minimizing the required bussing while meeting the school capacity and racial mix constraints. An entire zone is assigned to one school, thus preserving the neighborhood school concept. Viewing the possible zone-school assignments as a combinatorial problem, a general enumerative procedure is combined with probability theory to form the implicit enumeration algorithm. An explanation of the algorithm along with computational results of an application of the method to an existing school system is presented.