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

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

The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general ...

Did you consider yourself a mathematician the last time you sat down to solve a Sudoku puzzle? It’s certainly a mentally ...