Determining initial bound by "Ray-method" in branch and bound procedure

Rácz, Anett: Determining initial bound by "Ray-method" in branch and bound procedure. Acta cybernetica, (19) 1. pp. 135-146. (2009)

[img] Cikk, tanulmány, mű
actacyb_19_1_2009_9.pdf

Download (134kB)

Abstract

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.

Item Type: Article
Event Title: Conference for PhD Students in Computer Science, 6., 2008, Szeged
Journal or Publication Title: Acta cybernetica
Date: 2009
Volume: 19
Number: 1
Page Range: pp. 135-146
ISSN: 0324-721X
Language: angol
DOI: https://doi.org/10.14232/actacyb.19.1.2009.9
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 145-146.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 12:36
URI: http://acta.bibl.u-szeged.hu/id/eprint/12857

Actions (login required)

View Item View Item