A transportation branch and bound algorithm for solving the generalized assignment problem

被引：7

作者：

Munapo E. ^{[1
]}

Lesaoana M. ^{[2
]}

Nyamugure P. ^{[3
]}

Kumar S. ^{[4
]}

机构：

[1] Graduate School of Business and Leadership, University of KwaZulu-Natal, Westville Campus, Durban

[2] Department of Statistics and Operations Research, University of Limpopo, Bag X1106, Sovenga

[3] Department of Statistics and Operations Research, National University of Science and Technology, P.O. Box AC 939, Ascot, Bulawayo

[4] Department of Mathematics and Statistics, University of Melbourne, Parkville

来源：

International Journal of System Assurance Engineering and Management | 2015年 / 6卷 / 03期

关键词：

Branch and bound method; Generalized assignment problem; Transportation model;

D O I：

10.1007/s13198-015-0343-9

中图分类号：

学科分类号：

摘要：

This paper presents a transportation branch and bound algorithm for solving the generalized assignment problem. This is a branch and bound technique in which the sub-problems are solved by the available efficient transportation techniques rather than the usual simplex based approaches. A technique for selecting branching variables that minimize the number of sub-problems is also presented. © 2015, The Society for Reliability Engineering, Quality and Operations Management (SREQOM), India and The Division of Operation and Maintenance, Lulea University of Technology, Sweden.

引用

页码：217 / 223

页数：6

共 50 条

[1] BRANCH-AND-BOUND ALGORITHM FOR SOLVING GENERALIZED PROBLEM OF OPTIMAL ASSIGNMENT
BABKIN, VT
GASRETOV, AL
ZOLOTUKHIN, VF
[J]. ENGINEERING CYBERNETICS, 1977, 15 (06): : 37 - 42
[2] BRANCH AND BOUND ALGORITHM FOR GENERALIZED ASSIGNMENT PROBLEM
ROSS, GT
SOLAND, RM
[J]. MATHEMATICAL PROGRAMMING, 1975, 8 (01) : 91 - 103
[3] A hybrid tabu search/branch & bound approach to solving the generalized assignment problem
Woodcock, Andrew J.
Wilson, John M.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 207 (02) : 566 - 578
[4] A BRANCH AND BOUND ALGORITHM FOR SOLVING THE SUM OF GENERALIZED POLYNOMIAL FRACTIONAL PROGRAMMING PROBLEM
Liu, Xia
Ma, Xiao-Hua
Jing, Xia
[J]. JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2024, 25 (03) : 601 - 613
[5] Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
Haouari, M
Chaouachi, J
Dror, M
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (04) : 382 - 389
[6] A PARALLEL BRANCH AND BOUND ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM
ROUCAIROL, C
[J]. DISCRETE APPLIED MATHEMATICS, 1987, 18 (02) : 211 - 225
[7] A branch-and-price algorithm for the generalized assignment problem
Savelsbergh, M
[J]. OPERATIONS RESEARCH, 1997, 45 (06) : 831 - 841
[8] BRANCH AND BOUND ALGORITHM FOR SOLVING ONE SEQUENTIAL PROBLEM
BANK, B
SEIFFART, E
[J]. EKONOMICKO-MATEMATICKY OBZOR, 1969, (01): : 22 - 29
[9] Solving Quadratic Assignment Problem with Fixed Assignment (QAPFA) using Branch and Bound Approach
Syed-Abdullah, Sharifah Shuthairah
Abdul-Rahman, Syariza
Benjamin, Aida Mauziah
Wibowo, Antoni
Ku-Mahamud, Ku-Ruhana
[J]. 4TH INTERNATIONAL CONFERENCE ON OPERATIONAL RESEARCH (INTERIOR), 2018, 300
[10] A BRANCH-AND-BOUND-BASED HEURISTIC FOR SOLVING THE QUADRATIC ASSIGNMENT PROBLEM
BAZARAA, MS
KIRCA, O
[J]. NAVAL RESEARCH LOGISTICS, 1983, 30 (02) : 287 - 304

← 1 2 3 4 5 →