Show simple item record

dc.contributor.authorHosseini Alamdari, Soroush
dc.date.accessioned2018-10-23T13:21:50Z
dc.date.available2018-10-23T13:21:50Z
dc.date.issued2018-05-30
dc.identifier.otherHosseiniAlamdari_cornellgrad_0058F_10798
dc.identifier.otherhttp://dissertations.umi.com/cornellgrad:10798
dc.identifier.otherbibid: 10489417
dc.identifier.urihttps://hdl.handle.net/1813/59333
dc.description.abstractThree combinatorial problems are studied and efficient algorithms are presented for each of them. The first problem is concerned with lot-sizing, the second one arises in exam-scheduling, and the third lies on the intersection of the k-median and k-center clustering problems.
dc.language.isoen_US
dc.rightsAttribution 4.0 International*
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/*
dc.subjectOperations research
dc.titleExact and Approximate Algorithms for Some Combinatorial Problems
dc.typedissertation or thesis
thesis.degree.disciplineComputer Science
thesis.degree.grantorCornell University
thesis.degree.levelDoctor of Philosophy
thesis.degree.namePh. D., Computer Science
dc.contributor.chairShmoys, David B.
dc.contributor.committeeMemberKleinberg, Jon M.
dc.contributor.committeeMemberGomes, Carla P.
dcterms.licensehttps://hdl.handle.net/1813/59810
dc.identifier.doihttps://doi.org/10.7298/X4Z899NC


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, this item's license is described as Attribution 4.0 International

Statistics