<?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-11-21T02:32:32Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/27285" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/27285</identifier><datestamp>2026-09-24T03:01:36Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</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">Deza, Antoine</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Suarez, Carlos</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-01-19T21:01:44Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-01-19T21:01:44Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2021</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/27285</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/14385</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Linear optimization aims at maximizing, or minimizing, a linear objective function&#xd;
over a feasible region defined by a finite number of linear constrains. For&#xd;
several well-studied problems such as maxcut, all the vertices of the feasible region&#xd;
are integral, that is, with integer-valued coordinates. The diameter of the&#xd;
feasible region is the diameter of the edge-graph formed by the vertices and the&#xd;
edges of the feasible region. This diameter is a lower bound for the worst-case&#xd;
behaviour for the widely used pivot-based simplex methods to solve linear optimization&#xd;
instances. A lattice (d,k)-polytope is the convex hull of a set of points&#xd;
whose coordinates are integer ranging from 0 to k. This dissertation provides new&#xd;
insights into the determination of the largest possible diameter δ(d,k) over all&#xd;
possible lattice (d,k)-polytopes. An enhanced algorithm to determine δ(d,k) is&#xd;
introduced to compute previously intractable instances. The key improvements&#xd;
are achieved by introducing a novel branching that exploits convexity and combinatorial&#xd;
properties, and by using a linear optimization formulation to significantly&#xd;
reduce the search space. In particular we determine the value for δ(3,7).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">polytopes</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">lattices</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">diameter</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Discrete Geometry and Optimization Approaches for Lattice Polytopes</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>