Binary Integer Optimization Problems

Many problems that arise in manufacturing and socio-economic systems, such as machine scheduling, vehicle routing, resource management, and telecommunications network design, can be modeled as 0-1 integer programs. Therefore, the branch and bound algorithm, which is the core concept of this thesis, is proposed for the purpose of solving these problems significantly. The main goal is not only to present the theory and exact technique of this algorithm but also to build or construct an application to obtain the best solution of these models. Moreover, this application is expected to help the Businessmen, managers, decision makers, and interested people in this field to optimize many of these practical problems and save them some time which might be have been wasted looking for solutions for those problems.

Autorentext

Mr. Zayed has lived in Hebron, Palestine. He has worked as a part time instructor at Palestine polytechnic university. He holds master of science in Business Economics & Management & B.A in Contemporary Business Administration. He has a solid experience, training & research skills that enable him to deal successfully with multinational environment.