MARC보기
LDR01892nmm uu200397 4500
001000000332080
00520240805170000
008181129s2018 |||||||||||||||||c||eng d
020 ▼a 9780438353305
035 ▼a (MiAaPQ)AAI10829652
035 ▼a (MiAaPQ)umn:19347
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 248032
0820 ▼a 658
1001 ▼a Goyal, Shashank.
24510 ▼a Essays on the Online Multiple Knapsack Problem & the Online Reservation Problem.
260 ▼a [S.l.] : ▼b University of Minnesota., ▼c 2018
260 1 ▼a Ann Arbor : ▼b ProQuest Dissertations & Theses, ▼c 2018
300 ▼a 132 p.
500 ▼a Source: Dissertation Abstracts International, Volume: 80-01(E), Section: B.
500 ▼a Adviser: Diwakar Gupta.
5021 ▼a Thesis (Ph.D.)--University of Minnesota, 2018.
520 ▼a We study two problems in this thesis, viz. the online multiple knapsack problem (OMKP) and the online reservation problem (ORP).
520 ▼a 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
520 ▼a 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
590 ▼a School code: 0130.
650 4 ▼a Operations research.
690 ▼a 0796
71020 ▼a University of Minnesota. ▼b Industrial Engineering.
7730 ▼t Dissertation Abstracts International ▼g 80-01B(E).
773 ▼t Dissertation Abstract International
790 ▼a 0130
791 ▼a Ph.D.
792 ▼a 2018
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T14999330 ▼n KERIS
980 ▼a 201812 ▼f 2019
990 ▼a 관리자