Fast Compression of Large-Scale Hypergraphs for Solving Combinatorial Problems.
Takahisa TodaPublished in: Discovery Science (2013)
Keyphrases
- combinatorial problems
- combinatorial optimization
- solving hard
- graph coloring
- pseudo boolean
- constraint programming
- metaheuristic
- traveling salesman problem
- combinatorial search
- constraint satisfaction problems
- constraint satisfaction
- branch and bound algorithm
- phase transition
- constraint solvers
- sat encodings
- hard combinatorial optimization problems
- image compression
- branch and bound
- solving problems
- global constraints
- boolean satisfiability
- graph colouring
- lower bound
- optimization problems
- simulated annealing
- constraint solving
- constraint problems
- specific problems
- search problems
- finite domain
- constraint propagation
- np complete
- search space