This paper presents the results of experimentation on the development of an efficient branch-and-bound algorithm for the solution of zero-one linear mixed integer programming problems. An implicit ...

This article presents a new method for optimal matching in observational studies based on mixed integer programming. Unlike widely used matching methods based on network algorithms, which attempt to ...

Mixed integer programming modeling for the satellite three-dimensional component assignment and layout optimization problem [J].

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 ...