Both previous problems can be modeled as binary programming problems in
the following format: minimize cTx subject to Ax=b,
where x is a vector of binary variables, c is a cost vector and A
is the constraint matrix with right hand sides expressed in b.
Commercial and open source binary integer programming solvers are continually
improving. I'm currently contributing to the development of the COIN-OR Branch & Cut
Solver CBC. I'm also running
a benchmarking project to validade and tune