paper-with-me

홈 › Papers

Learning to Approximate Uniform Facility Location via Graph Neural Networks

2026-02-13 · Chendi Qian, Christopher Morris, Stefanie Jegelka, Christian Sohler arxiv

Neural networks, particularly message-passing neural networks (MPNNs), are increasingly used as heuristics for hard combinatorial optimization problems. Yet many learning-based methods rely on supervision, reinforcement learning, or gradient estimators, causing high computational cost, unstable training, or limited guarantees. Classical approximation algorithms provide worst-case guarantees but are non-differentiable and cannot adapt to structure in natural input distributions. We study this tradeoff through Uniform Facility Location (UniFL), a problem with applications in clustering, summarization, logistics, and supply chains. We propose a fully differentiable MPNN that incorporates approximation-algorithmic principles without solver supervision or discrete relaxations. The model has provable approximation guarantees and empirically improves on standard approximation algorithms, narrowing the gap to integer linear programming.

📄 PDF Abstract BibTeX arXiv:2602.13155

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Strategic Facility Location with Clients that Minimize Total Waiting Time

2022-11-25 · Simon Krogmann, Pascal Lenzner, Alexander Skopalik

We study a non-cooperative two-sided facility location game in which facilities and clients behave strategically. This is in contrast to many other facility location games in which clients simply visit their closest faci…

Strategy Proof Mechanisms for Facility Location with Capacity Limits

2020-09-17 · Toby Walsh

An important feature of many real world facility location problems are capacity limits on the facilities. We show here how capacity constraints make it harder to design strategy proof mechanisms for facility location, bu…

Strategy Proof Mechanisms for Facility Location at Limited Locations

2020-09-17 · Toby Walsh

Facility location problems often permit facilities to be located at any position. But what if this is not the case in practice? What if facilities can only be located at particular locations like a highway exit or close …

Position

Improved Bounds for Online Facility Location with Predictions

2021-07-17 · Dimitris Fotakis, Evangelia Gergatsouli, Themis Gouleakis, Nikolas Patris 외

We consider Online Facility Location in the framework of learning-augmented online algorithms. In Online Facility Location (OFL), demands arrive one-by-one in a metric space and must be (irrevocably) assigned to an open …

MAC Advice for Facility Location Mechanism Design

2024-03-18 · Zohar Barak, Anupam Gupta, Inbal Talgam-Cohen

Algorithms with predictions have attracted much attention in the last years across various domains, including variants of facility location, as a way to surpass traditional worst-case analyses. We study the $k$-facility …