Stack pre-marshalling problem: A heuristic-guided branch-and-bound algorithm

被引：0

作者：

College of Information Science and Engineering, Northeastern University, Shenyang, China ^{[1
]}

不详 ^{[2
]}

不详 ^{[3
]}

不详 ^{[4
]}

机构：

来源：

Int J Ind Eng Theory Appl Pract | 1600年 / 5卷 / 509-523期

关键词：

Engineering Village;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Branch-and-bound algorithms - Combinatorial optimization problems - Container logistics - Exact algorithms - Feasible solution - Optimum solution - Search efficiency - Stack pre-marshalling problem

引用

共 50 条

[41] The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
A. N. Maksimenko
Automatic Control and Computer Sciences, 2021, 55 : 816 - 826
[42] The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
Maksimenko, A. N.
AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2021, 55 (07) : 816 - 826
[43] An improved branch-and-bound algorithm for the test cover problem
Fahle, T
Tiemann, K
EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 89 - 100
[44] A branch-and-bound algorithm for the concave cost supply problem
Yenipazarli, Arda
Benson, Harold P.
Erenguc, Selcuk
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (13) : 3943 - 3961
[45] A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 298 (01) : 89 - 98
[46] A BRANCH-AND-BOUND ALGORITHM FOR ONE CLASS OF SCHEDULING PROBLEM
ANISIMOV, VG
ANISIMOV, YG
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1992, 32 (12) : 1827 - 1832
[47] A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Bettinelli, Andrea
Cacchiani, Valentina
Malaguti, Enrico
INFORMS JOURNAL ON COMPUTING, 2017, 29 (03) : 457 - 473
[48] A branch-and-bound algorithm for the continuous facility layout problem
Xie, Wei
Sahinidis, Nikolaos V.
COMPUTERS & CHEMICAL ENGINEERING, 2008, 32 (4-5) : 1016 - 1028
[49] Branch-and-bound algorithm for a competitive facility location problem
Beresnev, Vladimir
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (08) : 2062 - 2070
[50] A Branch-and-Bound Algorithm for the Molecular Ordered Covering Problem
Souza, Michael
Maia, Nilton
Marques, Romulo S.
Lavor, Carlile
JOURNAL OF COMPUTATIONAL BIOLOGY, 2024, 31 (06) : 475 - 485

← 1 2 3 4 5 →