A Local Search Algorithm for Balanced Incomplete Block Designs

@inproceedings{Prestwich2002ALS,
  title={A Local Search Algorithm for Balanced Incomplete Block Designs},
  author={Steven David Prestwich},
  booktitle={International Workshop on Constraint Solving and Constraint Logic Programming},
  year={2002}
}
Local search is often able to solve larger problems than systematic backtracking. To apply it to a constraint satisfaction problem, the problem is often treated as an optimization problem in which the search space is the total assignments, and the number of constraint violations is to be minimized to zero. Though often successful, this approach is sometimes unsuitable for structured problems with few solutions. An alternative is to explore the consistent partial assignments, minimizing the… CONTINUE READING