Set Variables and Local Search

DOI10.1007/11493853_4MaRDI QIDQ5450919zbMATH OpenOpenAlexFDO

Authors Magnus Ågren, Pierre Flener, Justin Pearson

Publication date 17 March 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11493853_4

Mathematics Subject Classification ID

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

Recommendations

• Local Search and Constraint Programming
• A general approach for constraint solving by local search
• Inferring Variable Conflicts for Local Search
• Localizer
• Contraint-based combinators for local search

Cited in

(9)

• Revisiting constraint-directed search
• Reasoning on sequences in constraint-based local search frameworks
• Generic incremental algorithms for local search
• Enhancing set constraint solvers with lexicographic bounds
• Inferring Variable Conflicts for Local Search
• A Generic Framework for Local Search: Application to the Sudoku Problem
• scientific article; zbMATH DE number 2032420 (Why is no real title available?)
• Filtering Atmost1 on Pairs of Set Variables
• \textsc{Athanor}: local search over abstract constraint specifications

This page was built for publication: Set Variables and Local Search

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