Show simple item record

dc.contributor.authorFleischman, Daniel
dc.date.accessioned2016-12-12T14:38:57Z
dc.date.available2016-12-12T14:38:57Z
dc.date.issued2016-08-22
dc.identifier.otherbibid: 9870371
dc.identifier.urihttps://hdl.handle.net/1813/45162
dc.language.isoen_US
dc.subjectDiscrete Optimization
dc.subjectSimplicity in Algorithm Design
dc.subjectData Structures
dc.titleComputational Approaches For Hard Discrete Optimization Problems
dc.typedissertation or thesis
thesis.degree.disciplineOperations Research
thesis.degree.grantorCornell University
thesis.degree.levelDoctor of Philosophy
thesis.degree.namePh. D., Operations Research
dc.contributor.chairShmoys,David B
dc.contributor.committeeMemberTodd,Michael Jeremy
dc.contributor.committeeMemberWilliamson,David P
dc.identifier.doihttps://doi.org/10.7298/X41G0J75


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics