An implicit branch-and-bound algorithm for mixed-integer linear programming
The authors present a branch-and-bound algorithm for solving the general mixed-integer linear programming problem of the form max \(c^ Tx\), subject to \(Ax=b\), \(x\geq 0\) and \(x_ j\) integer for \(j\in I\). Some numerical results are given.
scientific article; zbMATH DE number 4202025
scientific article