 |
Universität Augsburg
|
|
|
Universität Augsburg
|
|
Frau Sara Hein
spricht am
Montag, 26. Oktober 2026
um
14:00 Uhr
im
Raum 1010 (L1)
über das Thema:
| Abstract: |
| We study the p-α-closest-center problem, a generalization of the well-known p-center problem. Given a set of customers, a set of possible facility locations, distances between each customer and each possible facility location, as well as integers p and α, the goal of the p-α-closest-center problem is to open a facility at p of the possible facility locations such that the maximum sum of distances from any customer to its α closest open facilities is minimized. In this talk, we propose a mixed-integer programming formulation for the p-α-closest-center problem based on assignment variables, which is used to solve this problem exactly. We present additional formulations based on covering variables, for which we derive valid inequalities as well as inequalities preserving optimal solutions using combinatorial information. Furthermore, we prove that certain semi-relaxations of our covering formulations yield lower bounds equal to the best known lower bound so far. |
| Hierzu ergeht herzliche Einladung. |
| Prof. Dr. Elisabeth Gaar |