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 timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented.

The fixed charge transportation problem generalizes the well-known transportation problem where the cost of sending goods from a source to a sink is composed of a fixed cost and a continuous cost ...