An Integral Simplex Method for Solving Combinatorial Optimization Problems

Abstract : In this paper a local integral simplex method will be described which, starting with the initial tableau of a set partitioning problem, makes pivots using the pivot on one rule until no more such pivots are possible because a local optimum has been found. If the local optimum is also a gl... View More