Python Mip Versions Save

Python-MIP: collection of Python tools for the modeling and solution of Mixed-Integer Linear programs

1.16-pre

3 months ago

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 year ago

What's Changed

Full Changelog: https://github.com/coin-or/python-mip/compare/1.14.3...1.15.0

1.14.2

1 year ago

What's Changed

New Contributors

Full Changelog: https://github.com/coin-or/python-mip/compare/1.14.1...1.14.2

1.14.1

1 year ago

What's Changed

New Contributors

Full Changelog: https://github.com/coin-or/python-mip/compare/1.14.0...1.14.1

1.14.0

1 year ago

What's Changed

New Contributors

Full Changelog: https://github.com/coin-or/python-mip/compare/1.13.0...1.14.0

1.13.0

3 years ago

Mostly a bugfix release, all users are encourage to update:

  • updated CBC binaries; seems to fix some longstanding bugs in MacOS
  • documentation fixes
  • fix gurobi detection
  • fix query of LinExpr.violation when no solution is available

1.12.0

3 years ago
  • 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

3 years ago

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

3 years ago

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.

1.9.2

3 years ago
  • fix for loading MIPStart from a file
  • test for support for .gz and .bz2
  • remove mutable default arguments #93
  • tests now in github actions