Releases: coin-or/python-mip
1.16.0 pre
This release includes:
- Initial support for the HiGHS solver, a contribution from Robert Schwarz
- Initial support for Mac M1/M2/M3
1.15.0
1.14.2
What's Changed
- fix #303 thread parameter setting using setter by @Sceriffo in #304
- Update os and python versions as well as pyproject.toml (#319) by @sebheger in #320
- Update install.rst by @kasperdokter in #315
- Add support for gurobi v10 (#316) by @sebheger in #321
New Contributors
- @Sceriffo made their first contribution in #304
- @kasperdokter made their first contribution in #315
Full Changelog: 1.14.1...1.14.2
Contributors
Assets 2
Release 1.14.1
What's Changed
- Introduce pyproject.toml by @sebheger in #283
- Fix for
TypeError: can only concatenate str (not "type") to strby @Markus28 in #288 - Pin pypy version for CI by @sebheger in #295
- Update macos version in CI by @sebheger in #298
- Added pre-commit by @Markus28 in #293
- Fix Gurobi
objectiveby @Markus28 in #290 - Fix removal of variables (#294) by @sebheger in #296
- Update version of numpy by @sebheger in #301
- Remove and untrack mip/_version.py to make setuptools_scm work correctly by @sebheger in #302
New Contributors
Full Changelog: 1.14.0...1.14.1
Contributors
Assets 2
1.14.0
What's Changed
- Fix typo in quickstart by @dzhou343 in #177
- Fix line numbers on 0/1 Knapsack Problem example. by @Silventino in #212
- Remove repetition in docs by @fortierq in #232
- Fix broken link in docs by @fortierq in #231
- Make black happy again by @sebheger in #259
- fix: handle objective constant with gurobi by @peterlietz in #214
- Add some more tests and fix a rare case at failed optimization of unbounded model by @sebheger in #241
- Make black happy again by @sebheger in #261
- Update arithmetic of VAR entity and fixes attribute query by @sebheger in #244
- Fix missing starts by @aphi in #242
- Update CI for windows by @sebheger in #265
- LinExpr update and added tests by @sebheger in #264
- Add support for gurobi installed via gurobipy from pip (#185) by @sebheger in #271
- fixed closing bracket typo by @brmanuel in #243
- Reactivate all os / python version combinations in CI by @sebheger in #278
New Contributors
- @dzhou343 made their first contribution in #177
- @Silventino made their first contribution in #212
- @fortierq made their first contribution in #232
- @sebheger made their first contribution in #259
- @peterlietz made their first contribution in #214
- @aphi made their first contribution in #242
- @brmanuel made their first contribution in #243
Full Changelog: 1.13.0...1.14.0
Contributors
Assets 2
1.13.0
1.12.0
- ability to read and write LP optimal basis files (.bas extension)
- speedup gurobi initialization, thanks @jurasofish
- fix for querying column contents in callbacks, thanks @rodoufu
- fix for mip gap, thanks @nick-gorman
- fix for cbc in dense conflict graphs
1.11.0
Python-MIP 1.11.0
-
Two additional parameters, three depth and pass number, are now informed to the generage_constrs method in ConstrsGenerator class (which is used for cut/lazy constraints callbacks). Thus, strategies that generate more/less cuts at a given depth can use this information. See here .
-
Cut generators: additional cut generators can now be called at the root node in customized cutting planes algorithms, see here .
-
Instance features: it is now possible to query a vector of instance features. These features can be used in machine learning algorithms, for example, to decide the best parameter settings. Basic features are just the problems dimensions, e.g.: columns, rows, non-zeros. The current implementation extracts 208 instance features. To see an implementation of algorithm selection that is used in the COIN-OR Linear Programming Solver (CLP) check: Vilas Boas, M.G., Santos, H.G., Merschmann, L.H.C. and Vanden Berghe, G. Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches. International Transactions in Operational Research, DOI 10.1111/itor.12724. 2019.
1.10.0
This release release adds a new model method: clique_merge, which merges constraints of conflicting variables (usually set packing) to produce a more compact and stronger formulation.
Two new stopping criteria were added: max nodes/seconds without improving the incumbent solution.
We also added more tests and fixed some bugs in the Cbc C Interface.