Optimization-based mechanisms for the course allocation problem
From MaRDI portal
Publication:3386789
Recommendations
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
- Matching with indifferences: a comparison of algorithms in the context of course allocation
- A tale of two mechanisms: Student placement
- The object allocation problem with random priorities
- Efficient Resource Allocation on the Basis of Priorities
Cites work
Cited in
(9)- A direct barter model for course add/drop process
- Matching with indifferences: a comparison of algorithms in the context of course allocation
- An incentive dynamic programming method for the optimization of scholarship assignment
- An integer programming model for assigning students to elective courses
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
- Optimal block design models for course timetabling
- Optimum allocation of places to students in a national university system
- Goal programming approach for course affiliation problem
- Mathematical programming models and algorithms for a class--faculty assignment problem
This page was built for publication: Optimization-based mechanisms for the course allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386789)
