A Generic Framework for Local Search: Application to the Sudoku Problem

DOI10.1007/11758501_86MaRDI QIDQ3545055zbMATH OpenOpenAlexFDO

Authors Tony Lambert, Eric Monfroy, Frédéric Saubion

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758501_86

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1234562
• Set Variables and Local Search
• A general approach for constraint solving by local search
• scientific article; zbMATH DE number 2083802
• Local consistency for extended CSPs

Cited in

(2)

• A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
• Iterated local search with Trellis-neighborhood for the partial Latin square extension problem

This page was built for publication: A Generic Framework for Local Search: Application to the Sudoku Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545055)