KJCKorea
Journal Central

@article{ART001672572},
author={Junha Hwang},
title={Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2012},
volume={17},
number={6},
pages={13-27},
doi={}

TY - JOUR
AU - Junha Hwang
TI - Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem
JO - Journal of The Korea Society of Computer and Information
PY - 2012
VL - 17
IS - 6
PB - The Korean Society Of Computer And Information
SP - 13
EP - 27
SN - 1598-849X
AB - Integer programming-based local search(IPbLS) is a kind of local search based on simple hill-climbing search and adopts integer programming for neighbor generation unlike general local search. According to an existing research [1], IPbLS is known as an effective method for the multidimensional knapsack problem(MKP) which has received wide attention in operations research and artificial intelligence area. However, the existing research has a shortcoming that it verified the superiority of IPbLS targeting only largest-scale problems among MKP test problems in the OR-Library. In this paper, I verify the superiority of IPbLS more objectively by applying it to other problems. In addition, unlike the existing IPbLS that combines simple hill-climbing search and integer programming, I propose methods combining other local search algorithms like hill-climbing search, tabu search, simulated annealing with integer programming. Through the experimental results, I confirmed that IPbLS shows comparable or better performance than the best known heuristic search also for mid or small-scale MKP test problems.
KW - integer Programming-based Local Search;Multidimensional Knapsack Problem;Integer Programming;Local Search
DO -
ER -

Junha Hwang. (2012). Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem. Journal of The Korea Society of Computer and Information, 17(6), 13-27.

Junha Hwang. 2012, "Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem", Journal of The Korea Society of Computer and Information, vol.17, no.6 pp.13-27. Available from: doi:

Junha Hwang "Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem" Journal of The Korea Society of Computer and Information 17.6 pp.13-27 (2012) : 13.

Junha Hwang. Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem. 2012; 17(6), 13-27. Available from: doi:

Junha Hwang. "Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem" Journal of The Korea Society of Computer and Information 17, no.6 (2012) : 13-27.doi:

Junha Hwang. Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem. Journal of The Korea Society of Computer and Information, 17(6), 13-27. doi:

Junha Hwang. Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem. Journal of The Korea Society of Computer and Information. 2012; 17(6) 13-27. doi:

Junha Hwang. Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem. 2012; 17(6), 13-27. Available from: doi:

Junha Hwang. "Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem" Journal of The Korea Society of Computer and Information 17, no.6 (2012) : 13-27.doi: