자료유형 | E-Book |
---|---|
개인저자 | Hosseini Alamdari, Soroush. |
단체저자명 | Cornell University. Computer Science. |
서명/저자사항 | Exact and Approximate Algorithms for Some Combinatorial Problems. |
발행사항 | [S.l.] : Cornell University., 2018 |
발행사항 | Ann Arbor : ProQuest Dissertations & Theses, 2018 |
형태사항 | 55 p. |
소장본 주기 | School code: 0058. |
ISBN | 9780438026513 |
일반주기 |
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. |
언어 | 영어 |
기본자료 저록 | Dissertation Abstracts International79-10B(E). Dissertation Abstract International |
대출바로가기 | http://www.riss.kr/pdu/ddodLink.do?id=T14998078 |
인쇄
No. | 등록번호 | 청구기호 | 소장처 | 도서상태 | 반납예정일 | 예약 | 서비스 | 매체정보 |
---|---|---|---|---|---|---|---|---|
1 | WE00027501 | 658 | 가야대학교/전자책서버(컴퓨터서버)/ | 대출가능 |