Show simple item record

dc.contributor.advisorPınar, Mustafa Ç.
dc.contributor.authorYaman, Hande
dc.date.accessioned2016-01-08T20:16:23Z
dc.date.available2016-01-08T20:16:23Z
dc.date.issued1999
dc.identifier.urihttp://hdl.handle.net/11693/18114
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1999.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1999.en_US
dc.descriptionIncludes bibliographical references leaves 84-85en_US
dc.description.abstractIn this study, we investigate three well-known problems, the longest path problem on directed acyclic graphs, the minimum spanning tree problem and the single machine scheduling problem with total flow time criterion, where the input data for all problems are given as interval numbers. Since optimal solutions depend on the realization of the data, we define new optimality concepts to aid decision making. VVe present characterizations for these “optimal” solutions and suggest polynomial time algorithms to find them in some special cases.en_US
dc.description.statementofresponsibilityYaman, Handeen_US
dc.format.extentxi, 85 leaves, illustrationsen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectLongest Path Problem on Directed Acyclic Graphsen_US
dc.subjectPolynomial Time Algorithmsen_US
dc.subjectInterval Dataen_US
dc.subjectSingle Machine Scheduling Problem with Total Flow Time Criterionen_US
dc.subjectMinimum Spanning Tree Problemen_US
dc.subject.lccQA402.5 .Y36 1999en_US
dc.subject.lcshCombinatorial optimization.en_US
dc.subject.lcshInterval analysis (Mathematics).en_US
dc.titleEssays on some combinatorial optimization problems with interval dataen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record