Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search

V.C. Li; G.L. Curry

doi:10.1016/j.cor.2003.08.021

Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search

Computers & Operations Research ◽

10.1016/j.cor.2003.08.021 ◽

2005 ◽

Vol 32 (4) ◽

pp. 825-848 ◽

Cited By ~ 17

Author(s):

V.C. Li ◽

G.L. Curry

Keyword(s):

Tabu Search ◽

Upper Bound ◽

Knapsack Problems ◽

Critical Event ◽

Bound Constraints ◽

Multidimensional Knapsack

Download Full-text

Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints

Computers & Operations Research ◽

10.1016/j.cor.2004.04.020 ◽

2005 ◽

Vol 32 (11) ◽

pp. 2843-2852 ◽

Cited By ~ 13

Author(s):

Vincent C. Li

Keyword(s):

Tabu Search ◽

Upper Bound ◽

Knapsack Problems ◽

Bound Constraints ◽

Multidimensional Knapsack

Download Full-text

Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method

Computers & Operations Research ◽

10.1016/j.cor.2011.10.016 ◽

2012 ◽

Vol 39 (9) ◽

pp. 2111-2121 ◽

Cited By ~ 10

Author(s):

Vincent C. Li ◽

Yun-Chia Liang ◽

Huan-Fu Chang

Keyword(s):

Projection Method ◽

Upper Bound ◽

Knapsack Problems ◽

Adaptive Memory ◽

Bound Constraints ◽

Multidimensional Knapsack

Download Full-text

Critical Event Tabu Search for Multidimensional Knapsack Problems

Meta-Heuristics ◽

10.1007/978-1-4613-1361-8_25 ◽

1996 ◽

pp. 407-427 ◽

Cited By ~ 52

Author(s):

Fred Glover ◽

Gary A. Kochenberger

Keyword(s):

Tabu Search ◽

Knapsack Problems ◽

Critical Event ◽

Multidimensional Knapsack

Download Full-text

Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem

Annals of Operations Research ◽

10.1007/s10479-017-2675-0 ◽

2017 ◽

Vol 269 (1-2) ◽

pp. 3-19 ◽

Cited By ~ 2

Author(s):

Bahram Alidaee ◽

Vijay P. Ramalingam ◽

Haibo Wang ◽

Bryan Kethley

Keyword(s):

Tabu Search ◽

Knapsack Problem ◽

Computational Experiment ◽

Critical Event ◽

Multidimensional Knapsack Problem ◽

Multidimensional Knapsack

Download Full-text

A scatter search method for the multidimensional knapsack problem with generalized upper bound constraints

Journal of the Chinese Institute of Industrial Engineers ◽

10.1080/10170669.2012.743643 ◽

2012 ◽

Vol 29 (8) ◽

pp. 559-571

Author(s):

Vincent C. Li ◽

Yun-Chia Liang ◽

Yu-Yen Sun ◽

You-Shan Chen

Keyword(s):

Knapsack Problem ◽

Upper Bound ◽

Scatter Search ◽

Search Method ◽

Multidimensional Knapsack Problem ◽

Bound Constraints ◽

Multidimensional Knapsack

Download Full-text

Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints

Computers & Operations Research ◽

10.1016/j.cor.2021.105297 ◽

2021 ◽

pp. 105297

Author(s):

Eduardo A. J. Anacleto ◽

Cláudio N. Meneses ◽

Ricardo N. Liang

Keyword(s):

Quadratic Programming ◽

Closed Form ◽

Upper Bound ◽

Bound Constraints ◽

Quadratic Programming Problems ◽

Boolean Quadratic Programming

Download Full-text

A Novel Hybrid Tabu Search Algorithm With Binary Differential Operator for Knapsack Problems

2020 16th International Conference on Computational Intelligence and Security (CIS) ◽

10.1109/cis52066.2020.00062 ◽

2020 ◽

Author(s):

Jun Hu ◽

Qingfu Zhang ◽

Yong-Chang Jiao

Keyword(s):

Differential Operator ◽

Tabu Search ◽

Search Algorithm ◽

Knapsack Problems ◽

Tabu Search Algorithm

Download Full-text

When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners

Engineering Optimization ◽

10.1080/0305215x.2021.1933965 ◽

2021 ◽

pp. 1-13

Author(s):

Myung Soon Song ◽

Brooks Emerick ◽

Yun Lu ◽

Francis J. Vasko

Keyword(s):

Integer Programming ◽

Operations Research ◽

Knapsack Problems ◽

Multidimensional Knapsack ◽

Programming Software

Download Full-text

Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints

Mathematics of Operations Research ◽

10.1287/moor.16.3.504 ◽

1991 ◽

Vol 16 (3) ◽

pp. 504-533 ◽

Cited By ~ 3

Author(s):

Peter L. Jackson ◽

Robin O. Roundy

Keyword(s):

Upper Bound ◽

Bound Constraints

Download Full-text

A Novel Artificial Bee Colony Algorithm Based on Attraction Pheromone for the Multidimensional Knapsack Problems

Artificial Intelligence and Computational Intelligence - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23887-1_1 ◽

2011 ◽

pp. 1-10 ◽

Cited By ~ 1

Author(s):

Hongkai Wei ◽

Junzhong Ji ◽

Yufang Qin ◽

Yamin Wang ◽

Chunnian Liu

Keyword(s):

Artificial Bee Colony Algorithm ◽

Artificial Bee Colony ◽

Knapsack Problems ◽

Bee Colony ◽

Multidimensional Knapsack

Download Full-text