Double bound method for solving the \(p\)-center location problem

DOI10.1016/j.cor.2013.07.011zbMath1348.90384OpenAlexW2122578138MaRDI QIDQ336682

Barbaros C. Tansel, Hatice Calik

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.011

zbMATH Keywords

set coveringminimax location\(p\)-center locationcovering locationmulti-center location

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Distance in graphs (05C12)

Related Items (18)

Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem ⋮ A scalable exact algorithm for the vertex \(p\)-center problem ⋮ Capacitated \(p\)-center problem with failure foresight ⋮ A comparative study of different formulations for the capacitated discrete ordered median problem ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ The probabilistic \(p\)-center problem: planning service for potential customers ⋮ A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem ⋮ Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem ⋮ A robust \(p\)-center problem under pressure to locate shelters in wildfire context ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Exact solution approaches for the discrete α‐neighbor p‐center problem ⋮ The complete vertex \(p\)-center problem ⋮ GRASP and VNS for solving the \(p\)-next center problem ⋮ The stratified \(p\)-center problem ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants

Uses Software

• TSPLIB
• CPLEX
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
• Clustering to minimize the maximum intercluster distance
• A unified limited column generation approach for facility location problems on trees
• A New Formulation and Resolution Method for the p-Center Problem
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• New Results on the Complexity of p-Centre Problems
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
• A Canonical Representation of Simple Plant Location Problems and Its Applications
• Finite Dominating Sets for Network Location Problems
• TSPLIB—A Traveling Salesman Problem Library
• Convex Location Problems on Tree Networks
• The m-Center Problem: Minimax Facility Location
• Discrete Center Problems
• The m-Center Problem
• The Optimum Location of Multi-centres on a Graph
• The Location of Emergency Service Facilities
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Double bound method for solving the \(p\)-center location problem