An exact algorithm for the capacitated vertex p-center problem

Simple item page
dc.citation.epage1436en_US
dc.citation.issueNumber5en_US
dc.citation.spage1420en_US
dc.citation.volumeNumber33en_US
dc.contributor.authorÖzsoy, F. A.en_US
dc.contributor.authorPınar, M. Ç.en_US
dc.date.accessioned2016-02-08T10:19:26Z
dc.date.available2016-02-08T10:19:26Z
dc.date.issued2006en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients to them within capacity restrictions in order to minimize the maximum distance between a client and the facility to which it is assigned (capacitated p-center). The algorithm iteratively sets a maximum distance value within which it tries to assign all clients, and thus solves bin-packing or capacitated concentrator location subproblems using off-the-shelf optimization software. Computational experiments yield promising results.en_US
dc.identifier.doi10.1016/j.cor.2004.09.035en_US
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/23804
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2004.09.035en_US
dc.source.titleComputers & Operations Researchen_US
dc.subjectCapacitated p-center problemen_US
dc.subjectFacility locationen_US
dc.subjectInteger programmingen_US
dc.titleAn exact algorithm for the capacitated vertex p-center problemen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
An_exact_algorithm_for_the_capacitated_vertex_p-center_problem.pdf
Size:
221.1 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Industrial Engineering