The paper introduces a fully differentiable message‑passing neural network (MPNN) designed to approximate the Uniform Facility Location (UniFL) problem. Unlike many learning‑based approaches that require supervision or reinforcement learning, this model incorporates principles from classical approximation algorithms, providing provable approximation guarantees. Empirical results show that it outperforms standard approximation algorithms and reduces the performance gap to integer linear programming solutions.
By Chendi Qian, Christopher Morris, Stefanie Jegelka, Christian Sohler
arXiv:2607. 09745v1 Announce Type: new Abstract: This paper introduces SupplyNetPy, an open-source, well-documented Python library for modeling and discrete-event simulation of supply chain networks with arbitrary multi-echelon structures.
By Tushar Lone, Neha Karanjkar
The paper introduces a constraint‑aware conditional generative framework for creating synthetic origin‑destination demand data in hierarchical logistics networks. By modeling demand as a conditional distribution over destinations given each origin, the method incorporates differentiable operational constraints directly into the generative objective, allowing topology‑aware synthesis that remains operationally feasible. Experiments on industrial fulfillment and transportation networks show a 16% performance gain over graph neural network baselines, 87% operational compliance, and efficient cold‑start adaptation, supporting capacity planning, network design evaluation, and routing optimization.
By Leian Chen
arXiv:2608. 10245v1 Announce Type: cross Abstract: Inventory and distribution planning in Physical Internet networks requires coordinating factory-hub assignments, factory supply, lateral transshipment among collaborative hubs, retailer deliveries, and shortages.
By Faezeh Ardali, Gerald M. Knapp
arXiv:2502. 16533v3 Announce Type: replace-cross Abstract: Graph Transformers (GTs) have demonstrated a strong capability in modeling graph structures by addressing the intrinsic limitations of graph neural networks (GNNs), such as over-smoothing and over-squashing.
By Chaohao Yuan, Kangfei Zhao, Ercan Engin Kuruoglu, Liang Wang, Tingyang Xu, Wenbing Huang, Deli Zhao, Hong Cheng, Yu Rong
arXiv:2609.16738v1 Announce Type: cross
Abstract: Power Flow (PF), Optimal Power Flow (OPF), and State Estimation (SE) are fundamental problems in power system analysis, but solving them is computati...
By Ferran Bohigas-Daranas, Hamid Latif-Mart\'inez, Eduardo Prieto-Araujo, Oriol Gomis-Bellmunt, Pere Barlet-Ros
The paper presents a conservative learning‑augmented framework for designing a two‑echelon spare‑parts inventory network. It combines a graph neural network ensemble, variable neighborhood search, and set‑partitioning recombination to select cluster centers while limiting optimistic surrogate errors. In a case study on Amazon’s North American fulfillment network, the method achieves a 30.5% increase in combined savings over an exact‑evaluation baseline while preserving 99.8% service levels.
By Donato Maragno, Marco Caserta, Alberto Sinigaglia, Komlanvi Ametana, David Corredor Montenegro, Luca D'Angelo
arXiv:2509. 24256v2 Announce Type: replace-cross Abstract: The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets.
By Yunhao Liang, Pujun Zhang, Yuan Qu, Jingyuan Yang, Shaochong Lin, Zuo-jun Max Shen
arXiv:2608.23917v1 Announce Type: new
Abstract: Common shortest-path algorithms, such as Dijkstra's (SPF), that OSPF uses, provide exact routing solutions but must be recomputed for each network topo...
By Chia-Hong Chou, Katerina Potika
arXiv:2607. 26404v1 Announce Type: new Abstract: Graph Neural Networks (GNN) facilitate effective prediction on graph data such as molecules, media networks and neural network blueprints.
By Keith G. Mills, Aedan J. DeFrates, Joong Ho Kim
arXiv:2601. 23207v2 Announce Type: replace-cross Abstract: Understanding what graph neural networks can learn, especially their ability to learn to execute algorithms, remains a central theoretical challenge.
By Muhammad Fetrat Qharabagh, Artur Back de Luca, George Giapitzakis, Kimon Fountoulakis
arXiv:2507. 10834v4 Announce Type: replace Abstract: Assortment optimization seeks to select a subset of substitutable products, subject to constraints, to maximize expected revenue.
By Guokai Li, Pin Gao, Stefanus Jasin, Zizhuo Wang