Some heuristics as preprocessing for 0-1 integer programming
Item Usage Stats
MetadataShow full item record
It is well-known that 0-1 integer programming is one of the hard problems to solve other than special cases of constraint set in mathematical programming. In this thesis, some preprocessing will be done to get useful informations, such as feasible solutions, bounds for the number of Ts in feasible solutions, about the problem. A new algorithm to solve general (nonlinear) 0-1 programming with linear objective function will be devoloped. Preprocessing informations, then, are appended to original problem to show improvements in enumerative algorithms, e.g. in Branch and Bound procedures.