Skip to content

Latest commit

 

History

History
38 lines (25 loc) · 1.83 KB

README.md

File metadata and controls

38 lines (25 loc) · 1.83 KB

CombinatorialIntegralApproximations.jl

Solving binary approximation problems in Julia

Build Status

This package provides modelling tools and solution algorithms for combinatorial approximation problems arising, for instance, in mixed-integer optimal control. Implemented algorithms include:

  • Sum-Up and Rounding (SUR)
  • Mixed-integer linear programming (MILP)

Check out the CIA paper for a theoretical background and the pycombina paper for an algorithmic overview.

Some algorithms rely on:

  • JuMP for modelling or reformulating problems,
  • HiGHS.jl for solving those problems numerically.

Install

Use ] to enter pkg> mode of Julia, then

pkg> add CombinatorialIntegralApproximations

Documentation

Coming soon

Credits

CombinatorialIntegralApproximations.jl is a pure Julia implementation of the software package pycombina, developed in python (with the CombinaBnB solver written in C++).

Bug reports and discussions

Contributions are welcome in the form of issues notification or pull requests. We recommend looking at already implemented algorithms to get inspiration on how to structure new ones. If you think you found a bug, please open an issue. Focused suggestions and requests can also be opened as issues. Before opening a pull request, it is recommended to start an issue or a discussion on the topic.