Benders decomposition uses a strategy of``learning from one's mistakes.''The aim of this
paper is to extend this strategy to a much larger class of problems. The key is to generalize …

Abstract The University Course Scheduling Problem (UCSP) is a complex combinatorial
optimization problem. Most universities still use hand-operated scheduling, which usually …

This book is the first comprehensive guide to logic-based Benders decomposition (LBBD), a
general and versatile method for breaking large, complex optimization problems into …

In this paper, we describe our proposed methodology to approach the predict+ optimise
challenge introduced in the IEEE CIS 3rd Technical Challenge. The predictive model …

Algorithms that involve both forecasting and optimization are at the core of solutions to many
difficult real-world problems, such as in supply chains (inventory optimization), traffic, and in …

This paper presents a mathematical model of the multi-objective faculty course assignment
problem based on the double parametric form of fuzzy preferences. The fuzzy preferences …

We consider a complex university timetabling problem arising in a four-year study program
of teacher education where every student has to choose two subjects. Since any …

The university course scheduling problem is sub-problem of an educational timetabling
problem, aims to allot courses to faculty members so that the faculty members, administrator …

This paper deals with the school timetabling problem. The problem was formulated as
encountered in a typical Greek high school. A local version of the particle swarm …

The topic of solving Timetabling Problems is an interesting area of study. These problems
are commonly encountered in many institutions, particularly in the educational sector …