Evaluating school facility capacity and attendance boundaries using a large-scale assignment algorithm

Ahuja, 1993 Barr, 1977, A new alternating basis algorithm for semi-assignment networks, Mathematical Programming, 13, 1, 10.1007/BF01584319 Belford, 1972, A network-flow model for racially balancing schools, Operations Research, 20, 619, 10.1287/opre.20.3.619 Bertsekas, 1991 Clarke, 1968, An operations research approach to racial desegregation of school systems, Journal of Socio-economic Planning, 1, 259, 10.1016/0038-0121(68)90014-1 Dantzig, 1961, Decomposition principle for linear programs, Operations Research, 8, 101, 10.1287/opre.8.1.101 Elizondo, 1993 Ford, 1958, Constructing maximal dynamic plows from static flows, Operations Research, 6, 419, 10.1287/opre.6.3.419 Franklin, 1973, Computed school assignments in a large district, Operations Research, 21, 413, 10.1287/opre.21.2.413 Kennington, 1989, A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem Mine, 1982, Algorithms for the school distracting problem. Memoirs of the Faculty of Engineering, Kyoto University, 44, 168 Petruzielo, 1994