v0.5.0

Coluna v0.5.0

Diff since v0.4.2

Closed issues:

• Names for Data/Storage/StorageState (#330)
• Bad practices in tests (#376)
• Branching callback (#403)
• Lack of tests for Preprocessing algorithm (#433)
• Show fractional solution (#672)
• Storage Tests (#701)
• Tree search explore unit tests (#705)
• Storage documentation (#715)
• Reset subsolver parameters before each call to SolveLpForm/SolveIpForm (#732)

Merged pull requests:

• TreeSearch interface (#666) (@guimarqu)
• Tree Search design (#667) (@guimarqu)
• Toy demo in unit tests for TreeSearch interface (#668) (@guimarqu)
• Rework Algorithm interface for new tree search interface (#670) (@guimarqu)
• Tree search interface doc & finish test (#671) (@guimarqu)
• Rm tracker; rm conquer/divide in tree_search; simplifying interface (#673) (@guimarqu)
• Tree search interface v3 (#674) (@guimarqu)
• New storage API (#675) (@guimarqu)
• Decoupling strong branching from tree search data structures (#676) (@guimarqu)
• Support Representatives (#677) (@guimarqu)
• Extract branching rule selection / Start isolating interface from implementation in branching (#678) (@guimarqu)
• Removing branching group (#679) (@guimarqu)
• Remove unused fields from Node and SbNode (#680) (@guimarqu)
• Score interface & simplify children generation (#681) (@guimarqu)
• Refactor strong branching algorithm (#682) (@guimarqu)
• Integrate TreeSearch in the new interface (#683) (@guimarqu)
• Printer search space to print node information before conquer (#684) (@guimarqu)
• Fix some tests (#685) (@guimarqu)
• Node finalizer tests pass (#686) (@guimarqu)
• Tree search API doc (#687) (@guimarqu)
• Simplified version of storage (#688) (@guimarqu)
• Delete old code for storage (#690) (@guimarqu)
• Start simplifying interface built on top of NewStorage/NewRecord (#691) (@guimarqu)
• tree_order only in the printer (#692) (@guimarqu)
• File printer for tree search (#693) (@guimarqu)
• Clarify API on top of storage API (#694) (@guimarqu)
• CompatHelper: add new compat entry for "BlockDecomposition" at version "1.9" (#695) (@github-actions[bot])
• CompatHelper: add new compat entry for "Crayons" at version "4.1" (#696) (@github-actions[bot])
• Move definition of Node in BaB tree search implementation (#697) (@guimarqu)
• Group Algorithm Conquer Divide APIs (#698) (@guimarqu)
• @mustimplement to highlight APIs (#699) (@guimarqu)
• Branching API (#700) (@guimarqu)
• Branching API documentation (#703) (@guimarqu)
• Update index.md (#704) (@jolan99)
• Branching printer (#706) (@guimarqu)
• Split ColCutGenConquer run! method (#707) (@guimarqu)
• Id subtype of Integer (#709) (@guimarqu)
• Replace dynamic sparse vector by a static one in Solution. (#710) (@guimarqu)
• + - * operations for AbstractSolutions & dynamic sparse matrix (#711) (@guimarqu)
• Simplify linear algebra operations syntax in colgen (#712) (@guimarqu)
• DynamicSparseArrays documentation (#713) (@guimarqu)
• Add explore unit tests (#714) (@eduardovegas)
• Add methods to find best solution in storage docs (#716) (@eduardovegas)
• Fix variable of formulation (#718) (@guimarqu)
• doc + code organization in (re)formulation (#719) (@guimarqu)
• 2nd round of refactoring for column generation (#721) (@guimarqu)
• mv cat with partial sol from Algorithms to MOI_interface (#722) (@guimarqu)
• Integrate fixed vars with MOI interface (#723) (@guimarqu)
• Remove partial solution storage unit (#724) (@guimarqu)
• Presolve - Removal of fixed vars (#726) (@guimarqu)
• Fix the double addition of deactivated columns (#727) (@artalvpes)
• Preprocessing algorithm will be replaced by Presolve (#728) (@guimarqu)
• support of custom parameters for subsolvers (#729) (@guimarqu)
• fix colgen with parallelized subproblems (#730) (@guimarqu)
• improve _assert_has_lp_dual_sol error message (#731) (@guimarqu)
• Reset subsolver parameters after optimization (#733) (@guimarqu)
• MoiOptimize loglevel -> 2 (#734) (@guimarqu)
• larger redcost tolerance in colgen & improve error message (#737) (@guimarqu)
• Fix score printing in strong branching (#738) (@guimarqu)
• Don't run conquer on infeasible node (#739) (@guimarqu)
• missing get_priority method for BestDualBound explore strategy (#740) (@guimarqu)
• test BestDualBound explore strategy (#741) (@guimarqu)
• 0.5.0 (#742) (@guimarqu)