Algorithms for some discrete location problems

buir.advisorPınar, Mustafa Ç.
dc.contributor.authorÖzsoy, F. Aykut
dc.date.accessioned2017-12-26T07:44:29Z
dc.date.available2017-12-26T07:44:29Z
dc.date.copyright2003-09
dc.date.issued2003-09
dc.date.submitted2003-09
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2003.en_US
dc.descriptionIncludes bibliographical references (leaves 81-85).en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2017-12-26T07:44:28Z No. of bitstreams: 1 0002367.pdf: 697888 bytes, checksum: 1b5253374e93d34768b6c77f295fee72 (MD5)en
dc.description.provenanceMade available in DSpace on 2017-12-26T07:44:29Z (GMT). No. of bitstreams: 1 0002367.pdf: 697888 bytes, checksum: 1b5253374e93d34768b6c77f295fee72 (MD5) Previous issue date: 2003-09en
dc.description.statementofresponsibilityby F. Aykut Özsoy.en_US
dc.format.extentx, 85 leaves : tables ; 30 cmen_US
dc.identifier.itemidBILKUTUPB072046
dc.identifier.urihttp://hdl.handle.net/11693/35692
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectInteger programmingen_US
dc.subjectDiscrete locationen_US
dc.subjectP-center problemen_US
dc.subjectCapacitated p-center problemen_US
dc.subjectP-median problemen_US
dc.subject.lccT57.74 .O97 2003en_US
dc.titleAlgorithms for some discrete location problemsen_US
dc.title.alternativeBazı kesikli yerleşim problemleri için algoritmalaren_US
dc.typeThesisen_US
thesis.degree.disciplineIndustrial Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
0002367.pdf
Size:
681.53 KB
Format:
Adobe Portable Document Format
Description:
Full printable version

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: