p-center problems

Date

2015

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
3
views
88
downloads

Citation Stats

Series

Abstract

A 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.

Source Title

Publisher

Springer

Course

Other identifiers

Book Title

Location science

Degree Discipline

Degree Level

Degree Name

Citation

Language

English