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

by   Elisabeth Gaar, et al.

The discrete α-neighbor p-center problem (d-α-pCP) is an emerging variant of the classical p-center problem which recently got attention in literature. In this problem, we are given a discrete set of points and we need to locate p facilities on these points in such a way that the maximum distance between each point where no facility is located and its α-closest facility is minimized. The only existing algorithms in literature for solving the d-α-pCP are approximation algorithms and two recently proposed heuristics. In this work, we present two integer programming formulations for the d-α-pCP, together with lifting of inequalities, valid inequalities, inequalities that do not change the optimal objective function value and variable fixing procedures. We provide theoretical results on the strength of the formulations and convergence results for the lower bounds obtained after applying the lifting procedures or the variable fixing procedures in an iterative fashion. Based on our formulations and theoretical results, we develop branch-and-cut (B C) algorithms, which are further enhanced with a starting heuristic and a primal heuristic. We evaluate the effectiveness of our B C algorithms using instances from literature. Our algorithms are able to solve 116 out of 194 instances from literature to proven optimality, with a runtime of under a minute for most of them. By doing so, we also provide improved solution values for 116 instances.


page 1

page 2

page 3

page 4


Improved Formulations and Branch-and-cut Algorithms for the Angular Constrained Minimum Spanning Tree Problem

The Angular Constrained Minimum Spanning Tree Problem (α-MSTP) is define...

An exact solution framework for the multiple gradual cover location problem

Facility and covering location models are key elements in many decision ...

Mathematical models and search algorithms for the capacitated p-center problem

The capacitated p-center problem requires to select p facilities from a ...

A note on computational approaches for the antibandwidth problem

In this note, we consider the antibandwidth problem, also known as dual ...

New formulations and branch-and-cut procedures for the longest induced path problem

Given an undirected graph G=(V,E), the longest induced path problem (LIP...

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

The p-center problem (pCP) is a fundamental problem in location science,...

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks

The COVID-19 pandemic has been a recent example for the spread of a harm...

Please sign up or login with your details

Forgot password? Click here to reset