KJCKorea
Journal Central

@article{ART001481993},
author={Junha Hwang and Kim, Sung-Young},
title={Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2010},
volume={15},
number={9},
pages={47-55}

TY - JOUR
AU - Junha Hwang
AU - Kim, Sung-Young
TI - Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem
JO - Journal of The Korea Society of Computer and Information
PY - 2010
VL - 15
IS - 9
PB - The Korean Society Of Computer And Information
SP - 47
EP - 55
SN - 1598-849X
AB - Linear constraint satisfaction optimization problem is a kind of combinatorial optimization problem involving linearly expressed objective function and complex constraints. Integer programming is known as a very effective technique for such problem but require very much time and memory until finding a suboptimal solution. In this paper, we propose a method to improve the search performance by integrating local search and integer programming. Basically, simple hill-climbing search, which is the simplest form of local search, is used to solve the given problem and integer programming is applied to generate a neighbor solution. In addition, constraint programming is used to generate an initial solution. Through the experimental results using N-Queens maximization problems, we confirmed that the proposed method can produce far better solutions than any other search methods.
KW - 선형 제약 만족 최적화 문제(Linear Constraint Satisfaction Optimization Problem);지역 탐색(Local Search);정수계획법(Integer Programming)
DO -
UR -
ER -

Junha Hwang and Kim, Sung-Young. (2010). Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem. Journal of The Korea Society of Computer and Information, 15(9), 47-55.

Junha Hwang and Kim, Sung-Young. 2010, "Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem", Journal of The Korea Society of Computer and Information, vol.15, no.9 pp.47-55.

Junha Hwang, Kim, Sung-Young "Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem" Journal of The Korea Society of Computer and Information 15.9 pp.47-55 (2010) : 47.

Junha Hwang, Kim, Sung-Young. Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem. 2010; 15(9), 47-55.

Junha Hwang and Kim, Sung-Young. "Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem" Journal of The Korea Society of Computer and Information 15, no.9 (2010) : 47-55.

Junha Hwang; Kim, Sung-Young. Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem. Journal of The Korea Society of Computer and Information, 15(9), 47-55.

Junha Hwang; Kim, Sung-Young. Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem. Journal of The Korea Society of Computer and Information. 2010; 15(9) 47-55.

Junha Hwang, Kim, Sung-Young. Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem. 2010; 15(9), 47-55.

Junha Hwang and Kim, Sung-Young. "Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem" Journal of The Korea Society of Computer and Information 15, no.9 (2010) : 47-55.