Name
Abstract | ||
|---|---|---|
Global optimization has many real-world applications. Most methods for solving it are based on search,so decreasing its search space can increase the efficiency for their solving. Symmetry-breaking is an important technique for decreasing search space and it has been widely used in SAT,CSP and so on. In this paper, we try to decrease the search space of an unconstrained optimization problem by symmetry breaking.We present a method for extracting symmetries of an unconstrained optimization problem, and a method for constructing constraints to break those symmetries. The experimental results show that our methods are effective and efficient and symmetry-breaking can indeed increase the efficiency of global optimization problems solving. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ICIS.2009.66 | ACIS-ICIS |
Keywords | Field | DocType |
optimisation,important technique,global optimization,graph automorphism,search problems,unconstrained optimization problem,symmetry breaking,graph theory,symmetry-breaking,search space,global optimization problem,global unconstrained optimization problems,real-world application,application software,constraint optimization,programming,cognition,data mining,computer science,benchmark testing,geology,color,information science,markov processes,optimization | Mathematical optimization,Markov process,Symmetry breaking,Quadratic unconstrained binary optimization,Global optimization,Vector optimization,Optimization problem,Metaheuristic,Constrained optimization | Conference |
ISBN | Citations | PageRank |
978-0-7695-3641-5 | 2 | 0.37 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaohui Ji | 1 | 15 | 3.45 |
| Feifei Ma | 2 | 58 | 13.64 |
| Jian Zhang | 3 | 60 | 5.20 |