AN IMPROVED BINARY SEARCH ALGORITHM FOR THE MULTIPLE-CHOICE KNAPSACK PROBLEM

被引：6

作者：

He, Cheng ^{[1
]}

Leung, Joseph Y-T. ^{[2
]}

Lee, Kangbok ^{[3
]}

Pinedo, Michael L. ^{[4
]}

机构：

[1] Henan Univ Technol, Sch Sci, Zhengzhou 450001, Henan, Peoples R China

[2] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA

[3] CUNY York Coll, Dept Econ & Business, 94-20 Guy R Brewer Blvd, Jamaica, NY 11451 USA

[4] NYU, Stern Sch Business, Dept Informat Operat & Management Sci, 44 West 4th St, New York, NY 10012 USA

来源：

RAIRO-OPERATIONS RESEARCH | 2016年 / 50卷 / 4-5期

关键词：

Multiple-Choice Knapsack Problem (MCKP); Approximate binary search algorithm; Worst-case performance ratio; Multiple-choice Multi-dimensional Knapsack Problem (MMKP);

D O I：

10.1051/ro/2015061

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The Multiple-Choice Knapsack Problem is defined as a 0-1 Knapsack Problem with additional disjoint multiple-choice constraints. Gens and Levner presented for this problem an approximate binary search algorithm with a worst case ratio of 5. We present an improved approximate binary search algorithm with a ratio of 3 + (1/2)(t) and a running time O(n(t + log m)), where n is the number of items, m the number of classes, and t a positive integer. We then extend our algorithm to make it also applicable to the Multiple-Choice Multidimensional Knapsack Problem with dimension d.

引用

页码：995 / 1001

页数：7

共 50 条

[11] A FAST ALGORITHM FOR THE LINEAR MULTIPLE-CHOICE KNAPSACK-PROBLEM
DUDZINSKI, K
WALUKIEWICZ, S
OPERATIONS RESEARCH LETTERS, 1984, 3 (04) : 205 - 209
[12] A Stochastic Local Search Heuristic for the Multidimensional Multiple-choice Knapsack Problem
Xia, Youxin
Gao, Chao
Li, JinLong
BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2015, 2015, 562 : 513 - 522
[13] A BRANCH AND BOUND ALGORITHM FOR SOLVING THE MULTIPLE-CHOICE KNAPSACK-PROBLEM
DYER, ME
KAYAL, N
WALKER, J
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1984, 11 (02) : 231 - 249
[14] FUZZY MULTIPLE-CHOICE KNAPSACK-PROBLEM
OKADA, S
GEN, M
FUZZY SETS AND SYSTEMS, 1994, 67 (01) : 71 - 80
[15] THE LINEAR MULTIPLE-CHOICE KNAPSACK-PROBLEM
SARIN, S
KARWAN, MH
OPERATIONS RESEARCH LETTERS, 1989, 8 (02) : 95 - 100
[16] A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
M. Hifi
M. Michrafy
A. Sbihi
Computational Optimization and Applications, 2006, 33 : 271 - 285
[17] THE LINEAR MULTIPLE-CHOICE KNAPSACK-PROBLEM
ZEMEL, E
OPERATIONS RESEARCH, 1980, 28 (06) : 1412 - 1423
[18] The robust multiple-choice multidimensional knapsack problem
Caserta, Marco
Voss, Stefan
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2019, 86 : 16 - 27
[19] A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
Hifi, M
Michrafy, M
Sbihi, A
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2006, 33 (2-3) : 271 - 285
[20] A COMPUTATIONAL STUDY OF A MULTIPLE-CHOICE KNAPSACK ALGORITHM
ARMSTRONG, RD
KUNG, DS
SINHA, P
ZOLTNERS, AA
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1983, 9 (02): : 184 - 198

← 1 2 3 4 5 →