연구동향 분석

Steiner Ring Star 문제를 해결하기 위한 새로운 Mixed-Integer Programming Modeling

유준상(Junsang Yuh) 이영호(Youngho Lee) 박기경(Gigyoung Park) 2014년

논문상세정보
인용/피인용
' Steiner Ring Star 문제를 해결하기 위한 새로운 Mixed-Integer Programming Modeling' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 경영관리
  • mixed integer programming
  • reformulation-linearization technique
  • steinerringstarproblem
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
9,249 0

0.0%

' Steiner Ring Star 문제를 해결하기 위한 새로운 Mixed-Integer Programming Modeling' 의 참고문헌

  • The Ring-Star Problem : A New Integer Programming Formulation and a Branch- and-Cut Algorithm
    Simonetti, L. Discrete Applied Mathematics 159 (16) : 1901 ~ 1914 [2011]
  • The Ring Star Problem : Polyhedral Analysis and Exact Algorithm
    Labbé, M. Networks 43 : 177 ~ 189 [2004]
  • On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
    Sherali, H. D. Operations Research 50 (4) : 656 ~ 669 [2002]
  • New Tighter Polynomial Length Formulations for the Asymmetric Traveling Salesman Problem with and without Precedence Constraints
    Sarin, S. C. Operations Research Letters 33 (1) : 62 ~ 70 [2005]
  • Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problem
    Sherali, H. D. Operations Research 46 : 396 ~ 405 [1998]
  • A Comparison of Group Steiner Tree Formulations
    명영수 대한산업공학회지 37 (3) : 191 ~ 197 [2011]
  • A Class of Lifted Path and Flow-Based Formulations for the Asymmetric Traveling Salesman Problem with and without Precedence Constraints
    Sherali, H. D. Discrete Optimization 6 : 20 ~ 32 [2006]
  • A Branch and Cut Algorithm for the Steiner Ring Star Problem
    Lee, Y. International Journal of Management Science 4 : 21 ~ 34 [1998]
  • A Branch and Cut Algorithm for a Steiner Tree-Star Problem
    Lee, Y. INFORMS Journal on Computing 8 : 194 ~ 201 [1996]