Heinc, Emília and Bánhelyi, Balázs (2024) Testing the selection heuristic of the Accelerated Branch and Bound method. ANNALES MATHEMATICAE ET INFORMATICAE, 60. pp. 64-74. ISSN 1787-6117
|
Text
AMI_60_from64to74.pdf - Published Version Download (631kB) | Preview |
Abstract
This article examined the issue of selection heuristics for the ABB algorithm, a branch-and-bound method for determining the optimal solution structure in P-graphs. Previous studies have not investigated the possible effects of different heuristics on the running time of the ABB algorithm. In this study, we represent the results of applying three basic heuristics in randomly generated P-graphs. In particular, for P-graphs with matrix patterns, the LIFO heuristic is recommended because it performed the best, while the FIFO heuristic had the slowest running time.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Branch and Bound, mixed integer programming, production models |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| Depositing User: | Tibor Gál |
| Date Deposited: | 23 Jan 2025 13:28 |
| Last Modified: | 23 Jan 2025 13:28 |
| URI: | https://real.mtak.hu/id/eprint/214218 |
Actions (login required)
 |
Edit Item |
