A Binary Integer Programming Model for Global Optimization of Learning Path Discovery

@inproceedings{Belacel2014ABI,
title={A Binary Integer Programming Model for Global Optimization of Learning Path Discovery},
author={Nabil Belacel and Guillaume Durand and François LaPlante},
booktitle={EDM},
year={2014}
}

This paper introduces a method based on graph theory and operations research techniques to optimize learning path discovery. In this method, learning objects are considered as nodes and competencies as vertices of a learning graph. A first step consists in reducing the solution space by obtaining an induced subgraph H. In a second step, the search of an optimal learning path in H is considered as a binary integer programming problem which we propose to solve using an exact method based on the… CONTINUE READING