Skip to content
Stefan Vigerske edited this page Mar 4, 2019 · 1 revision

Bonmin development Wiki

New in trunk

09/04/2007, Pierre: I have added two new methods for doing some diving strategies with Cbc. As a consequence I renamed a few options. bonmin.nodeselect_stra is renamed to bonmin.node_comparison and there is a new option bonmin.tree_search_strategy:

  • bonmin.node_comparison behave the same way has before.
  • bonmin.tree_search_strategy can take three values:
    • top-node will behave same way has before (all nodes are put onto a heap and at each iteration of bab the top node is selected).
    • dive will do some dives into the tree from the best node on the heap until it hits a leaf.
    • bonmin.dfs-dive will do the same but with a few more backtracking before abandoning the current sub-tree. It can also start backtracking earlier if the current estimate is worst than the cutoff or if getting too deep in the tree.

09/15/2007, Pierre: To make use of estimates (best-guess) node comparison strategy, Cbc has to be configure with --enable-cbc-parallel

Useful links

Bonmin web pages

Couenne

Bonmin's Externals web pages

  • CoinUtils Wiki, doxydoc, latest release , latest stable
  • Osi Wiki, doxydoc, latest release , latest stable
  • Clp Wiki, doxydoc, latest release , latest stable
  • Cgl Wiki, doxydoc, latest release , latest stable
  • Cbc Wiki, doxydoc, latest release , latest stable
  • Ipopt Wiki, doxydoc, latest release , latest stable
  • Buildtools Wiki, latest release , latest stable

Bonmin's dependants

  • GAMSlinks Wiki, latest release

Attachments: