Chapter 1 Segment search approach for the general linear integer model

This chapter presents a segment-search approach for the general linear integer problem. In this approach the feasible region is divided into segments and searched for the optimal solution. The segments are searched in their ascending or descending order depending on the nature of the problem and a solution feasible in the kth segment is also optimal to the whole problem. This approach has the strength that large numbers of sub-problems that usually result in large linear problems can now be managed easily in this way.