1. Cyclic scheduling via integer programs with circular ones;Bartholdi;Operations Research,1980
2. Upper bounds for revenue maximization in a satellite scheduling problem;Benoist;4OR: A Quarterly Journal of Operations Research,2004
3. Exploring relaxation induced neighborhoods to improve MIP solutions;Danna;Mathematical Programming,2005
4. Dincbas, M., Simonis, H., van Hentenryck, P., 1988. Solving the car-sequencing problem in constraint logic programming. In: Kodratoff, Y., (Ed.), Proceedings of the ECAI-88, pp. 290–295.
5. Estellon, B., Gardi, F., Nouioua, K., 2005. Ordonnancement de véhicules: une approche par recherche locale à grand voisinage. In: Journées Françaises de Programmation par Contraintes, Angers.