Bonobo.jl
Bonobo.jl copied to clipboard
Wikunia
A general branch and bound framework
In some cases in the last nodes, we can have a lower bound that is greater than the incumbent (if all incoming nodes are about to be pruned because infeasible...
Implements #37 I'm not sure whether this approach is a reasonable one. There is a default `BnBNodeInfo` now which is used by a default constructor of an AbstractNode. The values...
Closes #5 Bonobo now creates a table like this such that the user is informed about the current status  Can be switched off by setting `log_table = false` in...
It does require all structs of the node to be passed as info, it is not super idiomatic since it does not leverage multiple constructors for instance. I would remove...
``` function add_new_solution!(tree::BnBTree{N,R,V,S}, node::AbstractNode) where {N,R,V,S
Save a struct options inside the tree object to save all kinds of options including: - [x] traversing strategy - [ ] printing - [x] branching strategy - [ ]...
I would like to add a generic debugging tool to this which saves the tree nodes in a json file as this is extremely helpful in my ConstraintSolver project. This...
Being able to store several solutions (all optimal solutions or even all solutions)