최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기韓國컴퓨터情報學會論文誌 = Journal of the Korea Society of Computer and Information, v.19 no.10, 2014년, pp.13 - 21
The set covering problem (SCP) is one of representative combinatorial optimization problems, which is defined as the problem of covering the m-rows by a subset of the n-columns at minimal cost. This paper proposes a method utilizing Integer Programming-based Local Search (IPbLS) to solve the set cov...
B. Gopalakrishnan, and E. Johnson, "Airline Crew Scheduling: State-of-the-Art", Anals of Operations Research, Vol. 140, No. 1, pp.305-337, Nov. 2005.
R.Z. Farahani, N. Asgari, N. Heidari, M. Hosseininia, and M. Goh, "Covering Problems in Facility Location: A Review", Computers & Industrial Engineering, Vol. 62, No. 1, pp.368-407, Feb. 2012.
E. Balas, and M.C. Carrera, "A Dynamic Subgradient-based Branch-and-bound Procedure for Set Covering", Operations Research, Vol. 44, No. 6, pp.875-890, Dec. 1996.
M. Yagiura, M. Kishida, and T. Ibaraki, "A 3-flip Neighborhood Local Search for the Set Covering Problem", European Journal of Operational Research, Vol. 172, No. 2, pp.472-499, July 2006.
A. Caprara, M. Fischetti, and P. Toth, "A Heuristic Method for the Set Covering Problem", Operations Research, Vol. 47, No. 5, pp.730-743, Oct. 1999.
J.E. Beasley, and P.C. Chu, "A Genetic Algorithm for the Set Covering Problem", European Journal of Operational Research, Vol. 94, No. 2, pp.392-404, Oct. 1996.
M. Caserta, "Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems", Metaheuristics: Progress in Complex Systems Optimization, Springer, pp.43-63, 2007.
Z. Ren, Z. Feng, L. Ke, and Z. Zhang, "New Ideas for Applying Ant Colony Optimization to the Set Covering Problem", Computers & Industrial Engineering, Vol. 58, No. 4, pp.774-784, May 2010.
B. Crawford, R. Soto, R. Cuesta, and F. Paredes, "Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem", The Scientific World Journal, 2014.
M. Yaghini, M.R. Sarmadi, and M. Momeni, "A Local Branching Approach for the Set Covering Problem", International Journal of Industrial Engineering & Production Research, Vol. 25, No. 2, pp.95-102, June 2014.
J.E. Beasley, "OR-Library: Distributing Test Problems by Electronic Mail", Journal of the Operational Research Society, Vol. 41, No. 11, pp.1069-1072, Nov. 1990.
L.A. Wolsey, "Integer Programming", Wiley, pp. 91-111, 1998.
J. Hwang, and S. Kim, "An Integer Programming-based Local Search for Large-scale Maximal Covering Problems", International Journal on Computer Science and Engineering, Vol. 3, No. 2, pp. 837-843, Feb. 2011.
"IBM ILOG CPLEX Optimization Studio CPLEX User's Manual, Version 12 Release 6", International Business Machines Corporation, 2013.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Free Access. 출판사/학술단체 등이 허락한 무료 공개 사이트를 통해 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.