The complete vertex \(p\)-center problem

DOI10.1007/s13675-020-00131-yzbMath1452.90224arXiv2109.12723OpenAlexW3202061538MaRDI QIDQ2219518

F. Antonio Medrano

Publication date: 20 January 2021

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.12723

zbMATH Keywords

mathematical programmingfacility locationlocation-allocation\(p\)-centerlocation set coveringspatial optimization

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Uses Software

• TSPLIB
• SITATION
• MOD-DIST
• MENU-OKF
• BEAMR
• GitHub
• SSCFLPsolver

Cites Work

• SITATION
• The disruptive anti-covering location problem
• Double bound method for solving the \(p\)-center location problem
• An effective heuristic for the \(P\)-median problem with application to ambulance location
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
• Facility siting and integer-friendly programming
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
• A scalable exact algorithm for the vertex \(p\)-center problem
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem
• BEAMR: an exact and approximate model for the \(p\)-median problem
• Network and Discrete Location: Models, Algorithms, and Applications, Second Edition
• A New Formulation and Resolution Method for the p-Center Problem
• Solving Large p-Median Problems with a Radius Formulation
• The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• TSPLIB—A Traveling Salesman Problem Library
• The p-center location problem in an area
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Integer Programming: Methods, Uses, Computations
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• The m-Center Problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: The complete vertex \(p\)-center problem