Required subroutines for BFS
Generating a least cost assignment
Generating the immediate successors of an assignment
- completeness: every feasible assignment must be the (eventual) successor of the least cost assignment
- monotonicity: if b is an immediate successor of a, then c(a) ? c(b)
Deciding that enough solutions have been generated
- maximum number of solutions
- minimum difference between cost of best feasible solution and the cost of the best assignment on the Agenda
- minimum difference between costs of the last two assignments
Agenda management as a priority queue