Investigating mixed-integer programming approaches for the $p$-$\alpha$-closest-center problem

TL;DR

This paper introduces the $p$-$lpha$-closest-center problem, generalizing classical facility location problems, and develops mixed-integer programming formulations and a branch-and-cut algorithm to solve it exactly, demonstrating improved computational performance.

Contribution

The paper presents four new MIP formulations, polyhedral insights, and an exact branch-and-cut algorithm for the $p$-$lpha$-closest-center problem, extending existing algorithms to a broader problem class.

Findings

Successfully proved optimality for 17 out of 40 benchmark instances.

Developed a branch-and-cut algorithm with heuristics and valid inequalities.

Enhanced solution bounds through iterative inequality lifting.

Abstract

In this work, we introduce and study the $p$-$\alpha$-closest-center problem ($p\alpha$CCP), which generalizes the $p$-second-center problem, a recently emerged variant of the classical $p$-center problem. In the $p\alpha$CCP, we are given sets of customers and potential facility locations, distances between each customer and potential facility location as well as two integers $p$ and $\alpha$. The goal is to open facilities at $p$ of the potential facility locations, such that the maximum $\alpha$-distance between each customer and the open facilities is minimized. The $\alpha$-distance of a customer is defined as the sum of distances from the customer to its $\alpha$ closest open facilities. If $\alpha$ is one, the $p\alpha$CCP is the $p$-center problem, and for $\alpha$ being two, the $p$-second-center problem is obtained, for which the only existing algorithm in literature is a variable neighborhood search (VNS). We present four mixed-integer programming (MIP) formulations for the $p\alpha$CCP, strengthen them by adding valid and optimality-preserving inequalities and conduct a polyhedral study to prove relationships between their linear programming relaxations. Moreover, we present iterative procedures for lifting some valid inequalities to improve initial lower bounds on the optimal objective function value of the $p\alpha$CCP and characterize the best lower bounds obtainable by this iterative lifting approach. Based on our theoretical findings, we develop a branch-and-cut algorithm (B&C) to solve the $p\alpha$CCP exactly. We improve its performance by a starting and a primal heuristic, variable fixings and separating inequalities. In our computational study, we investigate the effect of the various ingredients of our B&C on benchmark instances from related literature. Our B&C is able to prove optimality for 17 of the 40 instances from the work on the VNS heuristic.