Determining initial bound by "Ray-method" in branch and bound procedure
In this paper we present an algorithm for determining initial bound for the Branch and Bound (B&B) method. The idea of this algorithm is based on the use of "ray" as introduced in the "ray-method" developed for solving integer linear programming problems [11], [12]. Instead o...
Saved in:
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Article |
| Published: |
2009
|
| Series: | Acta cybernetica
19 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| doi: | 10.14232/actacyb.19.1.2009.9 |
| Online Access: | http://acta.bibl.u-szeged.hu/12857 |
| Summary: | In this paper we present an algorithm for determining initial bound for the Branch and Bound (B&B) method. The idea of this algorithm is based on the use of "ray" as introduced in the "ray-method" developed for solving integer linear programming problems [11], [12]. Instead of solving an integer programming problem we use the main idea of the ray-method to find an integer feasible solution of an integer linear programming problem along the ray as close to an optimal solution of the relaxation problem as possible. The objective value obtained in this manner may be used as an initial bound for the B&B method. It is well known that getting a "good bound" as soon as possible can often significantly increase the performance of the B&B method. |
|---|---|
| Physical Description: | 135-146 |
| ISSN: | 0324-721X |