|
gptkb:MAX-SAT
|
yes
|
|
gptkb:bin_packing_problem
|
branch and bound
|
|
gptkb:MAX-CUT_problem
|
exponential time algorithm
|
|
gptkb:one-dimensional_bin_packing
|
branch and bound
|
|
gptkb:Max-Cut_problem
|
exponential time algorithms
|
|
gptkb:Euclidean_TSP
|
branch and bound
|
|
gptkb:traveling_salesman_problem
|
yes
|
|
gptkb:one-dimensional_bin_packing
|
dynamic programming
|
|
gptkb:bin_packing_problem
|
dynamic programming
|
|
gptkb:vertex_cover_problem_(optimization_version)
|
exponential time
|
|
gptkb:Max_Cut
|
exponential time algorithm
|
|
gptkb:Euclidean_TSP
|
dynamic programming
|
|
gptkb:directed_Steiner_tree_problem
|
yes
|
|
gptkb:subset_sum_problem_(optimization_version)
|
pseudo-polynomial time algorithm
|