Showing 1 - 10 of 47
Persistent link: https://www.econbiz.de/10011396458
Persistent link: https://www.econbiz.de/10003994518
Persistent link: https://www.econbiz.de/10009690445
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...
Persistent link: https://www.econbiz.de/10011944892
Admission to universities is organised in a centralised scheme in Hungary. In this paper we investigate two major specialities of this application: ties and common quotas. A tie occur when some students have the same score at a programme. If not enough seats are available for the last tied group...
Persistent link: https://www.econbiz.de/10012629767
Pairwise comparison matrices are increasingly used in settings where some pairs are missing. However, there exist few inconsistency indices for similar incomplete data sets and no reasonable measure has an associated threshold. This paper generalises the famous rule of thumb for the acceptable...
Persistent link: https://www.econbiz.de/10012704476
In a two-sided matching market when agents on both sides have preferences the stability of the solution is typically the most important requirement. However, we may also face some distributional constraints with regard to the minimum number of assignees or the distribution of the assignees...
Persistent link: https://www.econbiz.de/10013172329
Safety is paramount in the construction industry and the fixed sprinkler and water spray systems used in firefighting involve networks of pipes of various lengths. Manufacturers of such fixed firefighting systems need to either cut the existing stocks to length—a (one-dimensional)...
Persistent link: https://www.econbiz.de/10014548971
When two students with the same score are competing for the last slot at a university programme in a central admission scheme then different policies may apply across countries. In Ireland only one of these students is admitted by a lottery. In Chile both students are admitted by slightly...
Persistent link: https://www.econbiz.de/10014554950
The minimum sum-of-squares clusering is the most widely used clustering method. The minimum sum-of-squares clustering is usually solved by the heuristic KMEANS algorithm, which converges to a local optimum. A lot of effort has been made to solve such kind of problems, but a mixed integer linear...
Persistent link: https://www.econbiz.de/10014554951