<?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-21T07:45:54Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/25001" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/25001</identifier><datestamp>2026-09-24T03:45:47Z</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">Kirubarajan, Thia</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Li, Jingqun</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2019-10-07T14:35:27Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2019-10-07T14:35:27Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2019</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/25001</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/15548</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Efficient multi-dimensional assignment algorithms and their application in multi-frame tracking</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">In this work, we propose a novel convex dual approach to the multidimensional dimensional&#xd;
assignment problem, which is an NP-hard binary programming problem.&#xd;
It is shown that the proposed dual approach is equivalent to the Lagrangian relaxation&#xd;
method in terms of the best value attainable by the two approaches. However,&#xd;
the pure dual representation is not only more elegant, but also makes the theoretical&#xd;
analysis of the algorithm more tractable. In fact, we obtain a su cient and necessary&#xd;
condition for the duality gap to be zero, or equivalently, for the Lagrangian relaxation&#xd;
approach to  nd the optimal solution to the assignment problem with a guarantee.&#xd;
Also, we establish a mild and easy-to-check condition, under which the dual problem&#xd;
is equivalent to the original one. In general cases, the optimal value of the dual&#xd;
problem can provide a satisfactory lower bound on the optimal value of the original&#xd;
assignment problem.&#xd;
We then extend the purely dual formulation to handle the more general multidimensional&#xd;
assignment problem. The convex dual representation is derived and its&#xd;
relationship to the Lagrangian relaxation method is investigated once again. Also,&#xd;
we discuss the condition under which the duality gap is zero. It is also pointed out&#xd;
that the process of Lagrangian relaxation is essentially equivalent to one of relaxing&#xd;
the binary constraint condition, thus necessitating the auction search operation to&#xd;
recover the binary constraint. Furthermore, a numerical algorithm based on the dual&#xd;
formulation along with a local search strategy is presented.&#xd;
Finally, the newly proposed algorithm is shown to outperform the Lagrangian&#xd;
relaxation method in a number of multi-target tracking simulations.</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">Binary programming</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Multi-target tracking</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">assignment problem</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING</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>