A Fast, Network-based, Hybrid Heuristic for the Assignment of Students to Schools
DOI10.1057/JORS.1989.176zbMath0684.90050OpenAlexW2021232365MaRDI QIDQ4735023
O. Benjamin Schoepfle, Richard L. Church
Publication date: 1989
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1989.176
hybrid heuristicdistricting problembounded transportation problemstudent assignmentstotal weighted distance
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (1)
This page was built for publication: A Fast, Network-based, Hybrid Heuristic for the Assignment of Students to Schools
