On the single-assignment p-hub center problem

Simple item page
dc.citation.epage655en_US
dc.citation.issueNumber3en_US
dc.citation.spage648en_US
dc.citation.volumeNumber125en_US
dc.contributor.authorKara, B. Y.en_US
dc.contributor.authorTansel, B. Ç.en_US
dc.date.accessioned2016-02-08T10:37:27Z
dc.date.available2016-02-08T10:37:27Z
dc.date.issued2000en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe study the computational aspects of the single-assignment p-hub center problem on the basis of a basic model and a new model. The new model's performance is substantially better in CPU time than different linearizations of the basic model. We also prove the NP-Hardness of the problem.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:37:27Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2000en
dc.identifier.doi10.1016/S0377-2217(99)00274-Xen_US
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/11693/24997
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/S0377-2217(99)00274-Xen_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.subjectCombinatorial mathematicsen_US
dc.subjectLinear programmingen_US
dc.subjectLinearizationen_US
dc.subjectMathematical modelsen_US
dc.subjectCentral processing unit timeen_US
dc.subjectHub locationen_US
dc.subjectSingle assignment hub center problemen_US
dc.subjectComputational complexityen_US
dc.titleOn the single-assignment p-hub center problemen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
On the single-assignment p-hub center problem.pdf
Size:
119.2 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering