I have a set of close mixed-integer programming problems. More exactly, all the problems share the same set of (binary and continuous) variables, the same set of linear inequality constraints, and the same linear objective function. However, linear equality constraints are specific to each problem.
Is there an algorithm to solve the set of problems that is more efficient than separate solving of each of the problems?
Both algorithms and references to solvers that do this are interesting. Thanks in advance.