A new mixed integer programming model for curriculum balancing: application to a Turkish university
DOI10.1016/J.EJOR.2014.03.015zbMATH Open1338.90240OpenAlexW2051119911MaRDI QIDQ296758FDOQ296758
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.03.015
Recommendations
- The balanced academic curriculum problem revisited
- The generalized balanced academic curriculum problem with heterogeneous classes
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study
- A new model for curriculum-based university course timetabling
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
educationlinear programmingbalanced academic curriculum problemcurriculum designgeneralized quadratic assignment problemLagrangian relaxation
Quadratic programming (90C20) Case-oriented studies in operations research (90B90) Mixed integer programming (90C11) Discrete location and assignment (90B80)
Cites Work
- Selected topics on assignment problems
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- The service allocation problem at the Gioia Tauro maritime terminal
- An algorithm for the generalized quadratic assignment problem
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
- On the quadratic assignment problem
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- Lagrangian relaxation based algorithm for trigeneration planning with storages
- Improved tabu search heuristics for the dynamic space allocation problem
- Lagrangian duality applied to the vehicle routing problem with time windows
- The balanced academic curriculum problem revisited
- A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem
- The multi-story space assignment problem
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
Cited In (2)
Uses Software
This page was built for publication: A new mixed integer programming model for curriculum balancing: application to a Turkish university
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296758)