Black-box complexities of combinatorial problems.
Benjamin DoerrJohannes LenglerTimo KötzingCarola WinzenPublished in: GECCO (2011)
Keyphrases
- black box
- combinatorial problems
- constraint programming
- metaheuristic
- traveling salesman problem
- constraint satisfaction
- graph coloring
- combinatorial optimization
- constraint satisfaction problems
- white box
- black boxes
- phase transition
- solving hard
- branch and bound algorithm
- test cases
- graph colouring
- hybrid systems
- integration testing
- global constraints
- combinatorial search
- data sets
- optimal solution
- search space
- simulated annealing
- genetic algorithm
- neural network
- data model
- cost function
- linear programming