Symmetry Breaking and Local Search Spaces

DOI10.1007/11493853_21zbMath1133.68431OpenAlexW1521204508MaRDI QIDQ5450938

Steven Prestwich, Andrea Roli

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_21

Mathematics Subject Classification ID

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

Related Items (6)

Hybrid Metaheuristics: An Introduction ⋮ The Relation Between Complete and Incomplete Search ⋮ Automated reformulation of specifications by safe delay of constraints ⋮ Symmetry breaking for voting mechanisms ⋮ Generalised graph colouring by a hybrid of local search and constraint programming ⋮ Exploiting relaxation in local search for LABS

Uses Software

• UBCSAT

This page was built for publication: Symmetry Breaking and Local Search Spaces