It converts every integer linear program into a shortest path problem.

It systematically partitions the problem and uses bounds to discard subproblems that cannot improve the current best solution.

It guarantees a feasible solution by ignoring integrality constraints.

It solves only minimization problems with two variables.