A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem

DOI10.1016/j.ejor.2022.02.016OpenAlexW4211117630WikidataQ113875423 ScholiaQ113875423MaRDI QIDQ2673558

Markus Sinnl, Elisabeth Gaar

Publication date: 10 June 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

liftinglocation\(p\)-center probleminteger programming formulationmin-max objective

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (5)

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 ⋮ An efficient Benders decomposition for the \(p\)-median problem ⋮ Exact solution approaches for the discrete α‐neighbor p‐center problem

Uses Software

• TSPLIB
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• 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
• Approximation algorithm for the kinetic robust \(k\)-center problem
• A scalable exact algorithm for the vertex \(p\)-center problem
• The Benders decomposition algorithm: a literature review
• A survey on Benders decomposition applied to fixed-charge network design problems
• Dominant, an algorithm for the \(p\)-center problem.
• Network and Discrete Location: Models, Algorithms, and Applications, Second Edition
• A New Formulation and Resolution Method for the p-Center Problem
• Integer Programming
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• TSPLIB—A Traveling Salesman Problem Library
• The m-Center Problem: Minimax Facility Location
• Location Science
• 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: A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem