Essays on some combinatorial optimization problems with interval data
| buir.advisor | Pınar, Mustafa Ç. | |
| dc.contributor.author | Yaman, Hande | |
| dc.date.accessioned | 2016-01-08T20:16:23Z | |
| dc.date.available | 2016-01-08T20:16:23Z | |
| dc.date.issued | 1999 | |
| dc.description | Ankara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1999. | en_US |
| dc.description | Thesis (Master's) -- Bilkent University, 1999. | en_US |
| dc.description | Includes bibliographical references leaves 84-85 | en_US |
| dc.description.abstract | In 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.provenance | Made available in DSpace on 2016-01-08T20:16:23Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5) | en |
| dc.description.statementofresponsibility | Yaman, Hande | en_US |
| dc.format.extent | xi, 85 leaves, illustrations | en_US |
| dc.identifier.uri | http://hdl.handle.net/11693/18114 | |
| dc.language.iso | English | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Longest Path Problem on Directed Acyclic Graphs | en_US |
| dc.subject | Polynomial Time Algorithms | en_US |
| dc.subject | Interval Data | en_US |
| dc.subject | Single Machine Scheduling Problem with Total Flow Time Criterion | en_US |
| dc.subject | Minimum Spanning Tree Problem | en_US |
| dc.subject.lcc | QA402.5 .Y36 1999 | en_US |
| dc.subject.lcsh | Combinatorial optimization. | en_US |
| dc.subject.lcsh | Interval analysis (Mathematics). | en_US |
| dc.title | Essays on some combinatorial optimization problems with interval data | en_US |
| dc.type | Thesis | en_US |
| thesis.degree.discipline | Industrial Engineering | |
| thesis.degree.grantor | Bilkent University | |
| thesis.degree.level | Master's | |
| thesis.degree.name | MS (Master of Science) |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- B048795.pdf
- Size:
- 2.29 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version