A direct barter model for course add/drop process

DOI10.1016/j.dam.2011.01.004zbMath1220.90069OpenAlexW2127474951MaRDI QIDQ534346

Ali Haydar Özer, Can Özturan

Publication date: 17 May 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.004

zbMATH Keywords

timetablingnetwork flowcourse schedulingadd dropbarter networkbarteringstudent registration

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Uses Software

• Netsoft

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Used car salesman problem: a differential auction-barter market
• Finding a feasible course schedule using Tabu search
• Constructing a course schedule by solving a series of assignment type problems
• Assigning students to course sections using tabu search
• Recent research directions in automated timetabling
• A survey of metaheuristic-based techniques for university timetabling problems
• Mathematical programming models and algorithms for a class--faculty assignment problem
• A methodology to optimize foundation seminar assignments
• Finding minimum-cost circulations by canceling negative cycles
• Erratum: The Stable Allocation (or Ordinal Transportation) Problem
• College Admissions and the Stability of Marriage
• Implementation of a university course and examination timetabling system

This page was built for publication: A direct barter model for course add/drop process