Gurobi

PhD project repository for algorithms and research on approximation-based heuristics for the Inventory Routing Problem and related topics.

read a text-file with a TAB b lines (a knows b) and creates a "a knows b and c and d, b knows a, ..." hashmap. it creates a BILP for guorbi and solves the max clique problem