Dropping the "complicating" constraints in a mixed-integer linear program often yields a "special structure subproblem" that can be reformulated using a different set of decision variables. Once the ...

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

This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic problems that seek optimal ...