ArticlesGenerating Feasible Schedules for a Pick-up and Delivery Problem
References (22)
- et al.
GSAT and Dynamic Backtracking
- et al.
Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis
Artificial Intelligence
(1977) - et al.
Constraint Satisfaction Using A Hybrid Evolutionary Hill-Climbing Algorithm That Performs Opportunistic Arc and Path Revision
(1996) - et al.
Hiding Our Colors
Proceedings of the 1995 Workshop on Studying and Solving Really Hard Problems
(1995) - et al.
Exploring the k-Colorable Landscape with Iterated Greedy. DIMACS Series, Volume 26, “Cliques, Coloring and Satisfiability”
- et al.
Systematic Versus Stochastic Constraint Satisfaction
Proceedings of the 14th International Joint Conference on Artificial Intelligence
(1995) - et al.
Dead-End Driven Learning
Dynamic Backtracking
Algorithms for Constraint Satisfaction Problems: a Survey
AI Magazine
(1992)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2000 Published by Elsevier B.V.