A direct barter model for course add/drop process
From MaRDI portal
Recommendations
- Preference-based assignment of university students to multiple teaching groups
- Timetabling problems at the TU Eindhoven
- scientific article; zbMATH DE number 1728532
- Optimization-based mechanisms for the course allocation problem
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A methodology to optimize foundation seminar assignments
- A survey of metaheuristic-based techniques for university timetabling problems
- Assigning students to course sections using tabu search
- College Admissions and the Stability of Marriage
- Constructing a course schedule by solving a series of assignment type problems
- Erratum: The Stable Allocation (or Ordinal Transportation) Problem
- Finding a feasible course schedule using Tabu search
- Finding minimum-cost circulations by canceling negative cycles
- Implementation of a university course and examination timetabling system
- Mathematical programming models and algorithms for a class--faculty assignment problem
- Network flows. Theory, algorithms, and applications.
- Recent research directions in automated timetabling
- Used car salesman problem: a differential auction-barter market
This page was built for publication: A direct barter model for course add/drop process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534346)
