Black-box complexities of combinatorial problems.
Benjamin DoerrTimo KötzingJohannes LenglerCarola WinzenPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- combinatorial problems
- black box
- constraint programming
- metaheuristic
- combinatorial optimization
- traveling salesman problem
- graph coloring
- constraint satisfaction problems
- solving hard
- phase transition
- constraint satisfaction
- white box
- black boxes
- branch and bound algorithm
- hybrid systems
- graph colouring
- integration testing
- combinatorial search
- test cases
- constraint propagation
- ant colony optimization
- global constraints
- sat encodings
- lower bound
- data sets
- branch and bound
- genetic algorithm
- search space
- upper bound
- satisfiability problem
- database