We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
In our talk we present an algorithm for determining initial bound for the Branch and Bound (B&B) method. The idea of the algorithm is based on the use of the "ray" introduced in the "ray-method" developed for solving integer programming problems [13], [14]. Instead of solving a common integer programming problem we use the main idea of the ray-method to find an integer feasible solution of
integer linear programming (ILP) problem along the ray as close to optimal solution of relaxation problem, as possible. Objective value obtained in this way may be used as an initial bound for B&B
method. The algorithm has been implemented in the frame of educational package WinGULF [3] for linear and linear-fractional programming and has been tested on various ILP problems. Then inspired by the results obtained we implemented the method using the so-called callable library of CPLEX package by IBM. omputational experiments with the algorithm proposed show that such preprocessing procedure in many cases results an integer feasible solution very close to the solution of relaxation problem. Initial bound for branch and bound method determined in this way often can significantly decrease the size of the binary tree to be searched and in this manner can improve performance of the B&B method
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.