Skip to content

Latest commit

 

History

History
17 lines (14 loc) · 638 Bytes

README.md

File metadata and controls

17 lines (14 loc) · 638 Bytes

ILP

This work proposes to implement a solver for Integer Linear Programming problems, applying the branch-and-bound technique with the Simplex algorithm.

  • Comments in code are in Portuguese

What You'll Need

How to run

  1. Add Eigen path to CMakeLists.txt
  2. Run: cmake . or cmake -G "MinGW Makefiles" . (in my case). Check: https://cmake.org/documentation/
  3. Run: make
  4. Run: ILP path/to/inputFile