<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-20T02:46:37Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/58181" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/58181</identifier><datestamp>2022-01-13T07:54:29Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Vivek F. Farias.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Park, Joongwoo Brian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-09-02T14:55:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-09-02T14:55:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2010</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2010</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/58181</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">635955071</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Cataloged from PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 53-54).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Network revenue management is the practice of using optimal decision policies to increase revenues by controlling limited quantities of multiple resources' availability and prices over finite time. It is widely practiced in capacity-constrained service industries such as the airlines, hotels, car rentals, and cruise-lines. A variety of control methods has been introduced for network resource capacity control problem. We propose a clustering method to improve approximation quality. By clustering the legs of the network, one can find tighter upperbound than leg-wise decomposition with loss of computation speed due to larger state space. We have shown that there is more than 6% revenue improvement opportunity by finding the right clustering. With local interchange heuristic and generic heuristics, finding a locally optimal clustering can be done in faster time. We also introduce risk-aversion in network revenue management. We have investigated risk-aversion on network revenue management and also study the impact of risk-aversion parameters in the optimization model on relative revenue-risk performance.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Joongwoo Brian Park.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">54 p.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.I.T. theses are protected by 
copyright. They may be viewed from this source for any purpose, but 
reproduction or distribution in any format is prohibited without written 
permission. See provided URL for inquiries about permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Capacity control in network revenue management : clustering and risk-aversion</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="12ad2cbb-d1ed-4792-9850-49cc408b879a">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Capacity control in network revenue management : clustering and risk-aversion&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2010&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Park, Joongwoo Brian&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Electrical Engineering and Computer Science.&lt;/Keyword&gt;
   	&lt;Abstract>Network revenue management is the practice of using optimal decision policies to increase revenues by controlling limited quantities of multiple resources&amp;apos; availability and prices over finite time. It is widely practiced in capacity-constrained service industries such as the airlines, hotels, car rentals, and cruise-lines. A variety of control methods has been introduced for network resource capacity control problem. We propose a clustering method to improve approximation quality. By clustering the legs of the network, one can find tighter upperbound than leg-wise decomposition with loss of computation speed due to larger state space. We have shown that there is more than 6% revenue improvement opportunity by finding the right clustering. With local interchange heuristic and generic heuristics, finding a locally optimal clustering can be done in faster time. We also introduce risk-aversion in network revenue management. We have investigated risk-aversion on network revenue management and also study the impact of risk-aversion parameters in the optimization model on relative revenue-risk performance.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>