Show simple item record

dc.contributor.authorWhite, John Lincoln
dc.date.accessioned2010-09-29 20:32:27 (GMT)
dc.date.available2010-09-29 20:32:27 (GMT)
dc.date.issued2010-09-29T20:32:27Z
dc.date.submitted2010
dc.identifier.urihttp://hdl.handle.net/10012/5543
dc.description.abstractThe Time-Dependent Traveling Salesman Problem is a generalization of the well-known Traveling Salesman Problem, where the cost for travel between two nodes is dependent on the nodes and their position in the tour. Inequalities for the Asymmetric TSP can be easily extended to the TDTSP, but the added time information can be used to strengthen these inequalities. We look at extending the Lifted Cycle Inequalities, a large family of inequalities for the ATSP. We define a new inequality, the Extended Cycle (X-cycle) Inequality, based on cycles in the graph. We extend the results of Balas and Fischetti for Lifted Cycle Inequalities to define Lifted X-cycle Inequalities. We show that the Lifted X-cycle Inequalities include some inequalities which define facets of the submissive of the TDTS Polytope.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectInteger Programmingen
dc.subjectTraveling Salesman Problemen
dc.titleA New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problemen
dc.typeMaster Thesisen
dc.pendingfalseen
dc.subject.programCombinatorics and Optimizationen
uws-etd.degree.departmentCombinatorics and Optimizationen
uws-etd.degreeMaster of Mathematicsen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages