Finding approximate solutions to combinatorial problems with very large data sets using BIRCH.
Justin HarringtonMatías Salibián BarreraPublished in: Comput. Stat. Data Anal. (2010)
Keyphrases
- combinatorial problems
- approximate solutions
- constraint programming
- metaheuristic
- np hard
- traveling salesman problem
- graph coloring
- constraint satisfaction problems
- branch and bound algorithm
- constraint satisfaction
- combinatorial optimization
- optimal solution
- solving hard
- hard optimization problems
- phase transition
- combinatorial search
- exact solution
- energy function
- np complete
- branch and bound
- clustering algorithm
- graph colouring
- upper bound
- search space
- lower bound
- hard combinatorial optimization problems