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.

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

A new integer programming dual problem is constructed from a reformulation of the integer programming problem. Properties of this integer programming dual problem are developed and it is shown that ...

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

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