P. C. Pop, A survey of different integer programming formulations of the generalized minimum spanning tree problem, Carpathian Journal of Mathematics, Vol. 25, No. 1 (2009), pp. 104-118 ...

Cutting Plane Methods: Iterative procedures that add valid inequalities (cuts) to eliminate non-integral solutions in a relaxed problem without removing any feasible integer solutions.

We demonstrate its applicability by considering the min-cost flow problem, by giving a novel algorithm for linear programming over unimodular spaces, and by providing a different proof that for ...

Integer Programming and Optimization Techniques Publication Trend The graph below shows the total number of publications each year in Integer Programming and Optimization Techniques.

Mixed integer programming modeling for the satellite three-dimensional component assignment and layout optimization problem [J].