Max clique problem solution by cplex method: [LP, ILP] and branch and bound algorithm method: [BnB]
usage: bnb_sedunov.py [-h] [--path PATH_TO_DIMACS_CLQ] --method {LP,ILP,BnB}
output: <graph_name.clq, clique_size_by_BnB, clique_size_by_cplex_ILP, time_exec, is_clique>