Exact solution approaches for the discrete α‐neighbor p‐center problem

DOI10.1002/net.22162zbMath1530.90051arXiv2211.12908OpenAlexW4380538205MaRDI QIDQ6180026

Elisabeth Gaar, Markus Sinnl

Publication date: 18 January 2024

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

location science\(p\)-center probleminteger programming formulationmin-max objective

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• The \(p\)-neighbor \(k\)-center problem
• Robust vertex \(p\)-center model for locating urgent relief distribution centers
• Double bound method for solving the \(p\)-center location problem
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• Local branching
• Fault tolerant \(K\)-center problems
• A scalable exact algorithm for the vertex \(p\)-center problem
• Compact MILP formulations for the \(p\)-center problem
• GRASP and VNS for solving the \(p\)-next center problem
• Dominant, an algorithm for the \(p\)-center problem.
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
• GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
• Network and Discrete Location: Models, Algorithms, and Applications, Second Edition
• A New Formulation and Resolution Method for the p-Center Problem
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• TSPLIB—A Traveling Salesman Problem Library
• The m-Center Problem: Minimax Facility Location
• Large-scale local search heuristics for the capacitated vertexp-center problem
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The m-Center Problem

This page was built for publication: Exact solution approaches for the discrete α‐neighbor p‐center problem