Show simple item record

dc.contributor.authorÇalık, Haticeen_US
dc.contributor.authorLabbé, M.en_US
dc.contributor.authorYaman, Handeen_US
dc.contributor.editorLaporte, G.
dc.contributor.editorNickel, S.
dc.contributor.editorGama, F. S. da
dc.date.accessioned2019-05-30T12:09:38Z
dc.date.available2019-05-30T12:09:38Z
dc.date.issued2015en_US
dc.identifier.isbn9783319131108
dc.identifier.urihttp://hdl.handle.net/11693/51963
dc.descriptionChapter 4
dc.description.abstractA p-center is a minimax solution that consists in a set of p points that minimizes the maximum distance between a demand point and a closest point belonging to that set. We present different variants of that problem. We review special polynomial cases, determine the complexity of the problems and present mixed integer linear programming formulations, exact algorithms and heuristics. Several extensions are also reviewed.en_US
dc.language.isoEnglishen_US
dc.relation.ispartofLocation scienceen_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-319-13111-5_4en_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-319-13111-5en_US
dc.subjectp-Centeren_US
dc.subjectLocation in public sectoren_US
dc.subjectMinimax facility locationen_US
dc.titlep-center problemsen_US
dc.typeBook Chapteren_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage79en_US
dc.citation.epage92en_US
dc.identifier.doi10.1007/978-3-319-13111-5_4en_US
dc.publisherSpringeren_US
dc.identifier.eisbn9783319131115


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record