Publications

Detailed Information

최대 가중치 합 그래프 마디 분리 문제에 관한 연구 : (A)Study on the max up-to n-cut problem with negative edge weights

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors

김영일

Advisor
정성진
Issue Date
2006
Publisher
서울대학교 대학원
Keywords
MAX-CUTMAX-CUTNP-hardnessNP-hardnessInapproximability근사 불가능성Cut Polytope절단면 다면체정수 계획법Integer ProgrammingBranch-and-CutBranch-and-Cut
Description
학위논문(석사)--서울대학교 대학원 :산업공학과,2006.
Language
Korean
URI
http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000049218

https://hdl.handle.net/10371/11757
Files in This Item:
There are no files associated with this item.
Appears in Collections:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share