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: | Rácz Anett |
---|---|
Corporate Author: | Conference for PhD Students in Computer Science (6.) (2008) (Szeged) |
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 |
Similar Items
-
Determining initial bound by "Ray-method" in branch and bound procedure [abstract] /
by: Rácz Anett
Published: (2008) -
Testing the selection heuristic of the Accelerated Branch and Bound method
by: Heinc Emília, et al.
Published: (2024) -
A branch-and-bound algorithm for the coupled task problem
by: Békési József, et al.
Published: (2014) -
Implications in bounded systems
by: Dombi József, et al.
Published: (2014) -
Alternation bounds for tree automata
by: Salomaa Kai
Published: (1992)