1. Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
2. Baptiste P. , Le Pape C. , Nuijten W. Incorporating efficient operations research algorithms in constraint-based scheduling.Proc. 1st Internat. Joint Workshop Artificial Intelligence and Operations Research(1995) Timberline Lodge, Oregon
3. An Algorithm for Solving the Job-Shop Problem
4. Caseau Y. , Laburthe F. , van Hentenryck P. Improved CLP scheduling with task intervals.Proc. 11th Internat. Conf. Logic Programming(1994) (MIT Press, Cambridge, Mass)