Integer programming methods for special college admissions problems

Kolos Agoston, Péter Biró and Iain McBride ()
Additional contact information
Iain McBride: University of Glasgow Sir Alwyn Williams Building

Journal of Combinatorial Optimization, 2016, vol. 32, issue 4, No 21, 1399 pages

Abstract: Abstract We develop integer programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of lower and common quotas, and paired applications. We note that each of the latter three special feature makes the college admissions problem NP-hard to solve. Currently, a heuristic based on the Gale–Shapley algorithm is being used in the Hungarian application. The IP methods that we propose are not only interesting theoretically, but may also serve as an alternative solution concept for this practical application, and other similar applications. We finish the paper by presenting a simulation using the 2008 data of the Hungarian higher education admission scheme.

Keywords: College admissions problem; Integer programming; Stable score-limits; Lower quotas; Common quotas; Paired applications; Simulations; C61; C63; C78 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0085-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
Working Paper: Integer programming methods for special college admissions problems (2016)
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:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-016-0085-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0085-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().