Phase transition in the knapsack problem.
Nitin YadavCarsten MurawskiSebastian SardiñaPeter BossaertsPublished in: CoRR (2018)
Keyphrases
- knapsack problem
- phase transition
- combinatorial optimization problems
- constraint satisfaction
- dynamic programming
- satisfiability problem
- np complete
- randomly generated
- np hard
- optimization problems
- combinatorial problems
- hard problems
- optimal solution
- random instances
- exact algorithms
- graph coloring
- greedy algorithm
- multidimensional knapsack problem
- sat problem
- np complete problems
- cellular automata
- continuous relaxation
- random constraint satisfaction problems
- random graphs
- random sat
- maximum profit
- state space
- genetic algorithm
- machine learning