Adaptive memory search for multidemand multidimensional knapsack problems

Halvard Arntzen; Lars M. Hvattum; Arne Løkketangen

doi:10.1016/j.cor.2005.07.007

Adaptive memory search for multidemand multidimensional knapsack problems

Computers & Operations Research ◽

10.1016/j.cor.2005.07.007 ◽

2006 ◽

Vol 33 (9) ◽

pp. 2508-2525 ◽

Cited By ~ 17

Author(s):

Halvard Arntzen ◽

Lars M. Hvattum ◽

Arne Løkketangen

Keyword(s):

Memory Search ◽

Knapsack Problems ◽

Adaptive Memory ◽

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

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

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

Multidimensional Knapsack Problems

10.1007/springerreference_72490 ◽

2012 ◽

Keyword(s):

Knapsack Problems ◽

Multidimensional Knapsack

Download Full-text

An effective hybrid harmony search-based algorithm for solving multidimensional knapsack problems

Applied Soft Computing ◽

10.1016/j.asoc.2015.01.022 ◽

2015 ◽

Vol 29 ◽

pp. 288-297 ◽

Cited By ~ 41

Author(s):

Biao Zhang ◽

Quan-Ke Pan ◽

Xin-Li Zhang ◽

Pei-Yong Duan

Keyword(s):

Harmony Search ◽

Knapsack Problems ◽

Multidimensional Knapsack

Download Full-text

Solving Multidimensional Knapsack Problems by an Immune-inspired Algorithm

2007 IEEE Congress on Evolutionary Computation ◽

10.1109/cec.2007.4424909 ◽

2007 ◽

Cited By ~ 2

Author(s):

Maoguo Gong ◽

Licheng Jiao ◽

Wenping Ma ◽

Shuiping Gou

Keyword(s):

Knapsack Problems ◽

Multidimensional Knapsack

Download Full-text

Exact solution method to solve large scale integer quadratic multidimensional knapsack problems

Journal of Combinatorial Optimization ◽

10.1007/s10878-007-9105-1 ◽

2007 ◽

Vol 17 (2) ◽

pp. 157-167 ◽

Cited By ~ 16

Author(s):

D. Quadri ◽

E. Soutif ◽

P. Tolla

Keyword(s):

Exact Solution ◽

Large Scale ◽

Solution Method ◽

Knapsack Problems ◽

Multidimensional Knapsack

Download Full-text

A Novel Multi-Population Genetic Algorithm for Multiple-Choice Multidimensional Knapsack Problems

Advances in Computation and Intelligence - Lecture Notes in Computer Science ◽

10.1007/978-3-642-16493-4_16 ◽

2010 ◽

pp. 148-157 ◽

Cited By ~ 4

Author(s):

Qian Zhou ◽

Wenjian Luo

Keyword(s):

Genetic Algorithm ◽

Population Genetic ◽

Multiple Choice ◽

Knapsack Problems ◽

Multidimensional Knapsack ◽

Population Genetic Algorithm

Download Full-text

BPSOBDE: A Binary Version of Hybrid Heuristic Algorithm for Multidimensional Knapsack Problems

2017 13th International Conference on Computational Intelligence and Security (CIS) ◽

10.1109/cis.2017.00020 ◽

2017 ◽

Author(s):

Li Zhang ◽

Hong Li

Keyword(s):

Heuristic Algorithm ◽

Knapsack Problems ◽

Hybrid Heuristic ◽

Multidimensional Knapsack ◽

Hybrid Heuristic Algorithm

Download Full-text

An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

Management Science ◽

10.1287/mnsc.48.4.550.208 ◽

2002 ◽

Vol 48 (4) ◽

pp. 550-565 ◽

Cited By ~ 73

Author(s):

Dimitris Bertsimas ◽

Ramazan Demir

Keyword(s):

Dynamic Programming ◽

Approximate Dynamic Programming ◽

Knapsack Problems ◽

Programming Approach ◽

Dynamic Programming Approach ◽

Multidimensional Knapsack

Download Full-text