Streamlining Local Search for Spatially Balanced Latin Squares
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1539-1539.
Abstract
Streamlined constrained reasoning powerfully boosts the performance of backtrack search methods for finding hard combinatorial objects. We use so-called spatially balanced Latin squares to show how streamlining can also be very effective for local search: Our approach is much faster and generates considerably larger spatially balanced Latin squares than previously reported approaches (up to order 35; the previous best results could only generate solutions up to order 18). We also provide a detailed characterization of our streamliner and solution topology for small orders. We believe that streamlined local search is a general technique suitable for solving a wide range of hard combinatorial design problems.
@inproceedings{ijcai2005p330,
title = {Streamlining Local Search for Spatially Balanced Latin Squares},
author = {Smith, Casey and Gomes, Carla P. and Fernández, Cèsar},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1539--1539},
year = {2005},
url = {https://ijcai.org/proceedings/2005/330},
}
TY - CPAPER TI - Streamlining Local Search for Spatially Balanced Latin Squares AU - Smith, Casey AU - Gomes, Carla P. AU - Fernández, Cèsar T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 1539 EP - 1539 UR - https://ijcai.org/proceedings/2005/330 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
