Back to search

Cornell University

Exact and Approximate Algorithms for Some Combinatorial Problems

Abstract

dc:description.abstract

Three 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.

Degree

thesis:*
Name thesis:degree_name
Ph. D., Computer Science
Level thesis:degree_level
Doctor of Philosophy
Discipline thesis:degree_discipline
Computer Science
Grantor
Cornell University
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Hosseini Alamdari, Soroush
Chair dc:contributor.chair
  • Shmoys, David B.
Committee members dc:contributor.committeemember
  • Kleinberg, Jon M.
  • Gomes, Carla P.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • Attribution 4.0 International
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Bibid
10489417
Dc Identifier Other
ProQuest Submission ID: 10798
ProQuest Publication ID: 10813646

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Hosseini Alamdari, Soroush. Exact and Approximate Algorithms for Some Combinatorial Problems. Doctor of Philosophy thesis, Cornell University, 2018. https://hdl.handle.net/1813/59333