arXiv cs.AI· Haoran Liu, Guanyi Wang, Yu Yang·· 14 小时前AI 评分24
SAG-Sep：用稀疏增强图与 Onion-Guided 搜索加速圆容量割分离
SAG-Sep: Sparse Augmented Graphs and Onion-Guided Search for Rounded Capacity Cut Separation
AI 导读
SAG-Sep 通过单次编码器前向传播为节点打分，识别圆容量割（RCC）诱导子集，避免 NeuralSEP 式迭代预测-粗化推理。在 N=1000 客户的 NeuralSEP 基准上，配合无需训练的 Onion-Sweep 解码器，平均根间隙较最强基线降低 17.7%，单次分离迭代速度提升约 30 倍。该工作已被 NeurIPS 2026 主会接收。
正文 · 原文
Abstract:Rounded capacity cuts (RCCs) are among the most effective cuts for capacitated vehicle-routing relaxations, but exact separation is computationally prohibitive at scale. Existing heuristic and neural separators can be fast, but often fail to produce sufficiently many effective cuts within practical separation budgets. We introduce SAG-Sep, a separator that scores node membership in RCC-inducing subsets across vehicle-count levels from a fractional LP solution in a single encoder forward pass, avoiding the iterative predict-and-coarsen inference used by NeuralSEP-style separators. SAG-Sep encodes the LP solution as a Sparse Augmented Graph (SAG), adding flow-informed multi-hop edges that expose long-range routing structure without densifying attention. Beyond LP-aware sparse encoding, we observe that high-value exact RCCs are typically nested, organizing into onion-like subset families, and SAG-Sep's node scores track subset nesting depth. This motivates Onion-Sweep (OS), a training-free decoder that ranks customers by their scores, evaluates the RCC violation of every prefix of the ranking in one vectorized pass, and emits the most violated prefix of each replica together with a cross-replica family of nested proposals, converting independent node scores into structurally coordinated RCC candidates without a tuned threshold or probing band. On the NeuralSEP benchmark with N=1000 customer instances, SAG-Sep with OS reduces the average root gap by 17.7% relative to the strongest NeuralSEP baseline, while the single-pass SAG-Sep separator achieves a roughly 30-fold per-iteration neural separation speedup. Our findings suggest that LP-aware sparse encoding and the nested structure of high-value cuts are structural patterns worth leveraging in neural separation more broadly.
| Comments: | 42 pages, 4 figures, 26 tables. Accepted at NeurIPS 2026 (Main Track). Code: this https URL |
| Subjects: | Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Optimization and Control (math.OC) |
| MSC classes: | 90C57 (Primary), 90C27, 90B06, 68T07 (Secondary) |
| ACM classes: | I.2.6; G.1.6 |
| Cite as: | arXiv:2610.37952 [cs.LG] |
| (or arXiv:2610.37952v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2610.37952 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Haoran Liu [view email]
[v1]
Tue, 27 Oct 2026 20:37:06 UTC (320 KB)
来源：arXiv cs.AI · arxiv.org