We have found that the nontrivial integer programming problems we encounter tend to fall into two classes. The first class of problems is characterized by a relatively small number (less than 100) of ...

This paper establishes an intrinsic complexity for the integer-programming problem that goes well beyond the computational complexities of linear programming. To this end, it describes a procedure ...

Additionally, efforts have been made to extend the feasibility pump framework to general mixed integer variables, demonstrating its versatility beyond purely binary problems [4].

The feasibility pump is a well-established primal heuristic for mixed integer programming (MIP) that alternates between solving a linear programming (LP) relaxation of the original problem and ...