The robust spanning tree problem with interval data

Simple item page
dc.citation.epage40en_US
dc.citation.issueNumber1en_US
dc.citation.spage31en_US
dc.citation.volumeNumber29en_US
dc.contributor.authorYaman, H.en_US
dc.contributor.authorKaraşan, O. E.en_US
dc.contributor.authorPınar, M. Ç.en_US
dc.date.accessioned2016-02-08T10:34:58Z
dc.date.available2016-02-08T10:34:58Z
dc.date.issued2001en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractMotivated by telecommunications applications we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de5ne the robust spanning tree problem to hedge against the worst case contingency, and present a mixed integer programming formulation of the problem. We also de5ne some useful optimality concepts, and present characterizations for these entities leading to polynomial time recognition algorithms. These entities are then used to preprocess a given graph with interval data prior to the solution of the robust spanning tree problem. Computational results show that these preprocessing procedures are quite e9ective in reducing the time to compute a robust spanning tree.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:34:58Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2001en
dc.identifier.doi10.1016/S0167-6377(01)00078-5en_US
dc.identifier.eissn1872-7468
dc.identifier.issn0167-6377
dc.identifier.urihttp://hdl.handle.net/11693/24831
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/S0167-6377(01)00078-5en_US
dc.source.titleOperations Research Lettersen_US
dc.subjectInterval dataen_US
dc.subjectRobust optimizationen_US
dc.subjectSpanning treeen_US
dc.subjectUncertaintyen_US
dc.subjectAlgorithmsen_US
dc.subjectComputational complexityen_US
dc.subjectInteger programmingen_US
dc.subjectPolynomialsen_US
dc.subjectProblem solvingen_US
dc.subjectTelecommunication servicesen_US
dc.subjectTrees (mathematics)en_US
dc.subjectUncertain systemsen_US
dc.subjectMixed integer programmingen_US
dc.subjectPolynomial time recognition algorithmsen_US
dc.subjectOperations researchen_US
dc.titleThe robust spanning tree problem with interval dataen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
The robust spanning tree problem with interval data.pdf
Size:
120.31 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Industrial Engineering