A scaleable projection-based branch-and-cut algorithm for the $p$-center problem
From MaRDI portal
Publication:6375349
DOI10.1016/j.ejor.2022.02.016zbMath1507.90087arXiv2108.07045WikidataQ113875423 ScholiaQ113875423MaRDI QIDQ6375349
Publication date: 16 August 2021
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
This page was built for publication: A scaleable projection-based branch-and-cut algorithm for the $p$-center problem