| LDR | | 01968nam u200397 4500 |
| 001 | | 000000420301 |
| 005 | | 20190215164352 |
| 008 | | 181129s2018 |||||||||||||||||c||eng d |
| 020 | |
▼a 9780438353305 |
| 035 | |
▼a (MiAaPQ)AAI10829652 |
| 035 | |
▼a (MiAaPQ)umn:19347 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 658 |
| 100 | 1 |
▼a Goyal, Shashank. |
| 245 | 10 |
▼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. |
| 502 | 1 |
▼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 |
| 710 | 20 |
▼a University of Minnesota.
▼b Industrial Engineering. |
| 773 | 0 |
▼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 |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T14999330
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 201812
▼f 2019 |
| 990 | |
▼a ***1012033 |