<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-11-22T09:14:01Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/17733" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/17733</identifier><datestamp>2026-05-14T13:56:51Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</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="author" lang="en_US">Carnes, Timothy</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-10-20T20:20:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-10-20T06:56:57Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-10-20</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/17733</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">7061541</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">The primal-dual schema has been employed to provide approximation algorithms for a large variety of combinatorial optimization problems. This technique relies upon simultaneously constructing a primal integer solution that is feasible for the minimization problem of interest, as well as a dual solution whose objective function value serves as a lower bound. By operating in this framework, the advantages of using an LP-based method are obtained, such as generating an instance-dependent approximation ratio that may greatly improve on the theoretical worst-case, while obviating the need to actually solve an LP. In this thesis, we focus on the application of the simple dual-ascent method, where the feasible dual solution is modified by increasing only a single dual variable at a time, and obtain approximation algorithms for the following problems: capacitated covering problems with lot-sizing applications, the location routing problem with a global limit on locations, and a variant of the generalized assignment problem. For each of these areas, we introduce an exponential number of valid inequalities to strengthen the LP-relaxation, thereby decreasing the integrality gap. As we are only increasing a single dual variable at a time, each of the primal constraints is effectively providing the mechanism by which both the primal and dual solutions can be modified at any given time.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Approximation Algorithms Via The Primal-Dual Schema: Applications Of The Simple Dual-Ascent Method To Problems From Logistics</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author" lang="en_US">Carnes, Timothy</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="575bd814-1a10-4050-8442-96872b74aa65">
	&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>en_US&lt;/Language>
   	&lt;Title>Approximation Algorithms Via The Primal-Dual Schema: Applications Of The Simple Dual-Ascent Method To Problems From Logistics&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2010-10-20&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Carnes, Timothy&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
   	&lt;Abstract>The primal-dual schema has been employed to provide approximation algorithms for a large variety of combinatorial optimization problems. This technique relies upon simultaneously constructing a primal integer solution that is feasible for the minimization problem of interest, as well as a dual solution whose objective function value serves as a lower bound. By operating in this framework, the advantages of using an LP-based method are obtained, such as generating an instance-dependent approximation ratio that may greatly improve on the theoretical worst-case, while obviating the need to actually solve an LP. In this thesis, we focus on the application of the simple dual-ascent method, where the feasible dual solution is modified by increasing only a single dual variable at a time, and obtain approximation algorithms for the following problems: capacitated covering problems with lot-sizing applications, the location routing problem with a global limit on locations, and a variant of the generalized assignment problem. For each of these areas, we introduce an exponential number of valid inequalities to strengthen the LP-relaxation, thereby decreasing the integrality gap. As we are only increasing a single dual variable at a time, each of the primal constraints is effectively providing the mechanism by which both the primal and dual solutions can be modified at any given time.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>