Symmetry Breaking by Nonstationay Optimisation

S. Prestwich; B. Hnich; R. Rossi; S.A. Tarim

Symmetry Breaking by Nonstationay Optimisation

S. Prestwich, B. Hnich, R. Rossi, S.A. Tarim

Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Academic › peer-review

Abstract

We describe a new partial symmetry breaking method that can be used to break arbitrary variable/value symmetries in combination with depth first search, static value ordering and dynamic variable ordering. The main novelty of the method is a new dominance detection technique based on local search in the symmetry group. It has very low time and memory requirements, yet in preliminary experiments on BIBD design it breaks most symmetries and is competitive with several other methods

Original language	English
Title of host publication	Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science (AICS 2008) Aug. 27, 2008, Cork, Ireland
Pages	153-162
Publication status	Published - 2008
Event	19th Irish Conference on Artificial Intelligence and Cognitive Science (AICS 2008) Aug. 27, 2008, Cork, Ireland - Duration: 27 Aug 2008 → 27 Aug 2008

Conference

Conference	19th Irish Conference on Artificial Intelligence and Cognitive Science (AICS 2008) Aug. 27, 2008, Cork, Ireland
Period	27/08/08 → 27/08/08

Fingerprint Dive into the research topics of 'Symmetry Breaking by Nonstationay Optimisation'. Together they form a unique fingerprint.

Cite this

@inproceedings{c861dd5e058245feab96f1d519bcec95,

title = "Symmetry Breaking by Nonstationay Optimisation",

abstract = "We describe a new partial symmetry breaking method that can be used to break arbitrary variable/value symmetries in combination with depth first search, static value ordering and dynamic variable ordering. The main novelty of the method is a new dominance detection technique based on local search in the symmetry group. It has very low time and memory requirements, yet in preliminary experiments on BIBD design it breaks most symmetries and is competitive with several other methods",

author = "S. Prestwich and B. Hnich and R. Rossi and S.A. Tarim",

year = "2008",

language = "English",

pages = "153--162",

booktitle = "Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science (AICS 2008) Aug. 27, 2008, Cork, Ireland",

note = "19th Irish Conference on Artificial Intelligence and Cognitive Science (AICS 2008) Aug. 27, 2008, Cork, Ireland ; Conference date: 27-08-2008 Through 27-08-2008",

}

TY - GEN

T1 - Symmetry Breaking by Nonstationay Optimisation

AU - Prestwich, S.

AU - Hnich, B.

AU - Rossi, R.

AU - Tarim, S.A.

PY - 2008

Y1 - 2008

N2 - We describe a new partial symmetry breaking method that can be used to break arbitrary variable/value symmetries in combination with depth first search, static value ordering and dynamic variable ordering. The main novelty of the method is a new dominance detection technique based on local search in the symmetry group. It has very low time and memory requirements, yet in preliminary experiments on BIBD design it breaks most symmetries and is competitive with several other methods

AB - We describe a new partial symmetry breaking method that can be used to break arbitrary variable/value symmetries in combination with depth first search, static value ordering and dynamic variable ordering. The main novelty of the method is a new dominance detection technique based on local search in the symmetry group. It has very low time and memory requirements, yet in preliminary experiments on BIBD design it breaks most symmetries and is competitive with several other methods

M3 - Conference paper

SP - 153

EP - 162

BT - Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science (AICS 2008) Aug. 27, 2008, Cork, Ireland

T2 - 19th Irish Conference on Artificial Intelligence and Cognitive Science (AICS 2008) Aug. 27, 2008, Cork, Ireland

Y2 - 27 August 2008 through 27 August 2008

ER -