![]() | Monter d'un niveau |
Gendreau, M., Hertz, A., & Laporte, G. (1996). The Traveling Salesman Problem with Backhauls. Computers & Operations Research, 23(5), 501-508. Lien externe
Hertz, A., & Widmer, M. (1996). An improved tabu search approach for solving the job shop scheduling problem with tooling constraints. Discrete Applied Mathematics, 65(1-3), 319-345. Lien externe
Hertz, A., Mottet, Y., & Rochat, Y. (1996). On a scheduling problem in a robotized analytical system. Discrete Applied Mathematics, 65(1-3), 285-318. Lien externe
Robert, V., & Hertz, A. (août 1995). How to decompose constrained course scheduling problems into easier assignment type subproblems [Communication écrite]. 1st International Conference on the Practice and Theory of Automated Timetabling, Edinburgh, UK. Publié dans Lecture notes in computer science. Lien externe