2026-09-19T02:58:52Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/284552022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Owen Deutsch and Duane S. Boning.
Dukellis, John N. (John Nicholas), 1977-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-09-26T20:33:39Z
2005-09-26T20:33:39Z
2000
2000
http://hdl.handle.net/1721.1/28455
57031740
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Includes bibliographical references (leaves 87-88).
Linear and nonlinear assignment problems are addressed by the use of auction algorithms. The application of auction to the standard linear assignment problem is reviewed. The extension to nonlinear problems is introduced and illustrated with two examples. Techniques that are employed for model reduction include discretization, classification, and imposition of assignment constraints. The tradeoff between solution speed and optimality for the nonlinear problem is analyzed and demonstrated for the sample problem.
by John N. Dukellis.
M.Eng.
88 leaves
4018577 bytes
4028436 bytes
application/pdf
application/pdf
en_US
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Applications of auction algorithms to complex problems with constraints
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="9fea3e36-11d2-4a2e-9407-11deee202007">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>en_US</Language>
<Title>Applications of auction algorithms to complex problems with constraints</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2000</PublicationDate>
<Authors>
<Author>
<DisplayName>Dukellis, John N. (John Nicholas), 1977-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Linear and nonlinear assignment problems are addressed by the use of auction algorithms. The application of auction to the standard linear assignment problem is reviewed. The extension to nonlinear problems is introduced and illustrated with two examples. Techniques that are employed for model reduction include discretization, classification, and imposition of assignment constraints. The tradeoff between solution speed and optimality for the nonlinear problem is analyzed and demonstrated for the sample problem.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>