Publications
Detailed Information
단일 추가제약을 갖는 조합최적화문제를 위한 실용적 완화해법의 계산시간 분석 : A Complexity Analysis of a "pragmatic" relaxation method for the combinatorial optimization with a side constraint
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 홍성필 | - |
dc.date.accessioned | 2009-07-10T06:37:36Z | - |
dc.date.available | 2009-07-10T06:37:36Z | - |
dc.date.issued | 2000 | - |
dc.identifier.citation | 한국경영과학회지, 제25권, 제1호(2000). pp. 27-36 | en |
dc.identifier.issn | 1225-1119 | - |
dc.identifier.uri | https://hdl.handle.net/10371/5338 | - |
dc.identifier.uri | http://uci.or.kr/G300-j12251119.v25n1p27 | - |
dc.description.abstract | We perform a computational complexity analysis of a heuristic algorithm proposed in the literature for the combinatorial optimization problems extended with a single side-constraint. This algorithm, although such a view was not given in the original work, is a disguised version of an optimal Lagrangian dual solution technique. It also has been observed to be a very efficient heuristic producing near-optimal solutions for the primal problems in some experiments. Especially, the number of iterations grows sublinearly in terms of the network node size so that the heuristic seems to be particularly suitable for the application such as routing with semi-real time requirements. The goal of this paper is to establish a polynomial worst-case complexity of the algorithm in particular, the obtained complexity bound supports the sublinear growth of the required iterations. | en |
dc.description.sponsorship | 이 논문은 1999년도 한국학술진흥재단의 연구비에 의하여 연구되었음(KRF-99-E00125). | en |
dc.language.iso | ko | - |
dc.publisher | 한국경영과학회 = The Korean Operations Research and Management Science Society | en |
dc.title | 단일 추가제약을 갖는 조합최적화문제를 위한 실용적 완화해법의 계산시간 분석 | en |
dc.title.alternative | A Complexity Analysis of a "pragmatic" relaxation method for the combinatorial optimization with a side constraint | en |
dc.type | Article | en |
dc.contributor.AlternativeAuthor | Hong, Sung-Pil | - |
- Appears in Collections:
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.