This release is a major update of the algorithms. From now on, we will release new versions more frequently.
In the Algorithm submodule:
- Interface & generic implementation for the tree search algorithm; default implementation of a branch & bound; documentation
- Simplified interface for storages; documentation
- Interface & generic implementation for the branching algorithm; interface & default implementation for the strong branching; documentation
- Preparation of the conquer algorithm refactoring
- Preparation of the column generation algorithm refactoring
- Preparation of the refactoring of the algorithms calling the subsolver
- End of development of the Preprocessing algorithm (no unit tests and had bugs); it will be replaced by the Presolve algorithm that does not work
- Increase of the reduced cost tolerance in the column generation algorithm
- Separation of algorithm and printing logic
- Various bug fixes
In the MathProg submodule:
VarIds&ConstrIdsare subtype of Integer so we can use them as indices of sparse vectors and arrays- Solution are stored in sparse array from
SparseArrays(not a packed memory array fromDynamicSparseArrayanymore because the solution is static)
Other:
- Documentation of dynamic sparse arrays
- Support of expressions in BlockDecomposition