test BestDualBound explore strategy (#741)

* missing get_priority method for BestDualBound explore strategy * fix * test bestdualbound explore strategy
atoptima · Oct 4, 2022 · ac49df5 · ac49df5
1 parent 78a27d8
commit ac49df5
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 2 deletions.
diff --git a/src/Algorithm/treesearch/printer.jl b/src/Algorithm/treesearch/printer.jl
@@ -52,7 +52,8 @@ struct PrintedNode{Node<:AbstractNode} <: AbstractNode
 end
 
 get_parent(n::PrintedNode) = n.parent
-get_priority(explore, n::PrintedNode) = get_priority(explore, n.inner)
+get_priority(explore::AbstractExploreStrategy, n::PrintedNode) = get_priority(explore, n.inner)
+
 
 function tree_search_output(sp::PrinterSearchSpace, untreated_nodes)
     close_tree_search_file!(sp.file_printer)

diff --git a/test/e2e/generalized_assignment.jl b/test/e2e/generalized_assignment.jl
@@ -110,7 +110,7 @@
             "params" => CL.Params(
                 solver = ClA.TreeSearchAlgorithm(
                     conqueralg = ClA.ColCutGenConquer(
-                        stages = [ClA.ColumnGeneration(max_nb_iterations = 8)]
+                        stages = [ClA.ColumnGeneration(max_nb_iterations = 8)],
                     )
                 )
             ),