Publications
Detailed Information
최단경로 및 최대흐름 문제를 위한 다항시간 단체법에 관한 연구 : A Study on the polynomial-time simplex algorithms for the shortest path problem and the maximum flow problem
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 정성진 | - |
| dc.contributor.author | 정후상 | - |
| dc.date.accessioned | 2010-01-16T14:36:25Z | - |
| dc.date.available | 2010-01-16T14:36:25Z | - |
| dc.date.copyright | 2001. | - |
| dc.date.issued | 2001 | - |
| dc.identifier.uri | http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000063385 | kor |
| dc.identifier.uri | https://hdl.handle.net/10371/34727 | - |
| dc.description | 학위논문(박사)--서울대학교 대학원 :산업공학과,2001. | ko |
| dc.format.extent | iii, 105 장 | ko |
| dc.language.iso | ko | ko |
| dc.publisher | 서울대학교 대학원 | ko |
| dc.subject | 최단경로 문제 | ko |
| dc.subject | shortest path problem | ko |
| dc.subject | 최대흐름 문제 | ko |
| dc.subject | Maximum flow problem | ko |
| dc.subject | 단체법 | ko |
| dc.subject | Simpex algorithm | ko |
| dc.subject | 거리 라벨 | ko |
| dc.subject | Distance Label | ko |
| dc.subject | 다항시간 해법 | ko |
| dc.subject | polynomial-time algorithm | ko |
| dc.title | 최단경로 및 최대흐름 문제를 위한 다항시간 단체법에 관한 연구 | ko |
| dc.title.alternative | A Study on the polynomial-time simplex algorithms for the shortest path problem and the maximum flow problem | ko |
| dc.type | Thesis | - |
| dc.contributor.department | 산업공학과 | - |
| dc.description.degree | Doctor | ko |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.