상세정보
Export to Refworks부가기능
Essays on the Online Multiple Knapsack Problem & the Online Reservation Problem
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Essays on the Online Multiple Knapsack Problem & the Online Reservation Problem. |
| 개인저자 | Goyal, Shashank. |
| 단체저자명 | University of Minnesota. Industrial Engineering. |
| 발행사항 | [S.l.]: University of Minnesota., 2018. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2018. |
| 형태사항 | 132 p. |
| 기본자료 저록 | Dissertation Abstracts International 80-01B(E). Dissertation Abstract International |
| ISBN | 9780438353305 |
| 학위논문주기 | Thesis (Ph.D.)--University of Minnesota, 2018. |
| 일반주기 |
Source: Dissertation Abstracts International, Volume: 80-01(E), Section: B.
Adviser: Diwakar Gupta. |
| 요약 | We study two problems in this thesis, viz. the online multiple knapsack problem (OMKP) and the online reservation problem (ORP). |
| 요약 | The OMKP has applications in revenue management and scheduling. There are multiple identical knapsacks. Items arrive one at a time, each having a value-density and a size. Upon arrival, an item must either be placed into a knapsack or turned awa |
| 요약 | In the ORP, we model many problem features faced by resource owner in sharing-economy platforms, many of which operate as follows. Owners list availability of resources (such as apartments, cars or tutoring services), prices, and contract-length |
| 일반주제명 | Operations research. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
