A Network-Flow Model for Racially Balancing Schools

Peter C. Belford and H. Donald Ratliff
Additional contact information
Peter C. Belford: University of Florida, Gainesville, Florida
H. Donald Ratliff: University of Florida, Gainesville, Florida

Operations Research, 1972, vol. 20, issue 3, 619-628

Abstract: This paper is concerned with developing a procedure for assigning students to public schools optimally, given that a specified racial balance must be attained in each school. The criterion for optimality is to minimize the total number of miles traveled. The problem is formulated as a minimum-cost flow problem in a single-commodity network. A summary of the results achieved by the model for the Gainesville, Florida, school system is discussed.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.3.619 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:20:y:1972:i:3:p:619-628

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().