상세정보
Export to Refworks부가기능
Exact and Approximate Algorithms for Some Combinatorial Problems
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Exact and Approximate Algorithms for Some Combinatorial Problems. |
| 개인저자 | Hosseini Alamdari, Soroush. |
| 단체저자명 | Cornell University. Computer Science. |
| 발행사항 | [S.l.]: Cornell University., 2018. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2018. |
| 형태사항 | 55 p. |
| 기본자료 저록 | Dissertation Abstracts International 79-10B(E). Dissertation Abstract International |
| ISBN | 9780438026513 |
| 학위논문주기 | Thesis (Ph.D.)--Cornell University, 2018. |
| 일반주기 |
Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
Adviser: David B. Shmoys. |
| 요약 | Three combinatorial problems are studied and efficient algorithms are presented for each of them. The first problem is concerned with lot-sizing, the second one arises in exam-scheduling, and the third lies on the intersection of the k-median an |
| 일반주제명 | Operations research. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
