http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
RLT Approaches for Solving the Steiner Ring Star Problem
유준상(Junsang Yuh),이영호(Youngho Lee),박기경(Gigyoung Park),정주영(Juyoung Jung) 한국경영과학회 2012 한국경영과학회 학술대회논문집 Vol.2012 No.5
In this paper, we deal with a Steiner Ring Star (SRS) problem arising from the design of survivable telecommunication networks. We develop two mixed integer programming formulations for SRS problem based on Miller-Tucker-Zemlin (MTZ) and Sarin-Sherali-Bhootra (SSB) subtour elimination constraints, and apply the reformulationlinearization technique (RLT) to enhance the LPrelaxation lower bound. By exploiting the ring-star structure of underlying networks, we devise some valid inequalities that tighten the LP relaxation. Computational results demonstrate the effectiveness of the proposed solution procedure.
RLT Approaches for Solving the Steiner Ring Star Problem
유준상(Junsang Yuh),이영호(Youngho Lee),박기경(Gigyoung Park),정주영(Juyoung Jung) 대한산업공학회 2012 대한산업공학회 춘계학술대회논문집 Vol.2012 No.5
In this paper, we deal with a Steiner Ring Star (SRS) problem arising from the design of survivable telecommunication networks. We develop two mixed integer programming formulations for SRS problem based on Miller-Tucker-Zemlin (MTZ) and Sarin-Sherali-Bhootra (SSB) subtour elimination constraints, and apply the reformulationlinearization technique (RLT) to enhance the LPrelaxation lower bound. By exploiting the ring-star structure of underlying networks, we devise some valid inequalities that tighten the LP relaxation. Computational results demonstrate the effectiveness of the proposed solution procedure.
Steiner Ring Star 문제를 해결하기 위한 새로운 Mixed-Integer Programming Modeling
유준상(Junsang Yuh),이영호(Youngho Lee),박기경(Gigyoung Park) 한국경영과학회 2014 한국경영과학회지 Vol.39 No.1
In this paper, we deal with a Steiner Ring Star (SRS) problem arising from the design of survivable telecommunication networks. We develop two mixed integer programming formulations for the SRS problem by implementing Miller- Tucker-Zemlin (MTZ) and Sarin-Sherali-Bhootra (SSB) subtour elimination constraints, and then apply the reformulationlinearization technique (RLT) to enhance the lower bound obtained by the LP relaxation. By exploiting the ring-star structure of underlying network, we devise some valid inequalities that tighten the LP relaxation. Computational results demonstrate the effectiveness of the proposed solution procedure.
균형할당 설비 입지 결정 문제 해결을 위한 알고리즘 개발
박찬우(Chanwoo Park),유준상(Junsang Yuh),이영호(Youngho Lee) 한국경영과학회 2011 한국경영과학회 학술대회논문집 Vol.2011 No.5
In this paper, we consider a balanced facility location problem (BFLP) that seeks to minimize the difference between the maximum and minimum numbers of allocated customers. We develop alternative mixed integer programming models for the problem. By exploiting the structure of the problem, we devise some classes of valid inequalities and preprocessing rules to improve the branch-and-cut procedure. We also develop an effective tabu search procedure for finding a good quality feasible solution. Computational result demonstrates the effectiveness of the proposed solution procedures.
균형할당 설비 입지 결정 문제 해결을 위한 알고리즘 개발
박찬우(Chanwoo Park),유준상(Junsang Yuh),이영호(Youngho Lee) 대한산업공학회 2011 대한산업공학회 춘계학술대회논문집 Vol.2011 No.5
In this paper, we consider a balanced facility location problem (BFLP) that seeks to minimize the difference between the maximum and minimum numbers of allocated customers. We develop alternative mixed integer programming models for the problem. By exploiting the structure of the problem, we devise some classes of valid inequalities and preprocessing rules to improve the branch-and-cut procedure. We also develop an effective tabu search procedure for finding a good quality feasible solution. Computational result demonstrates the effectiveness of the proposed solution procedures.