PulseAugur
中
实时 08:45:47
English(EN) The Edge-based Contiguous p-median Problem with Connections to Logistics Districting

新的ECpM问题表述优化道路网络划分

作者 PulseAugur 编辑部 · [1 个来源] ·

研究人员引入了一个新的问题表述，称为基于边的连续p-中值（ECpM）问题，旨在将道路网络划分为紧凑且连续的区域。该论文提出了两种二元规划模型来解决这个问题，一种使用带有指数约束的分支切割算法，另一种采用可由标准求解器解决的多项式最短路径约束。后者方法在大型道路网络上的计算速度比基于割集的算法快了17倍，显示出显著的加速效果。 AI

排序理由 该集群包含一篇详细介绍新问题表述和求解方法的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.AI 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →

新的ECpM问题表述优化道路网络划分

本文如何被排名

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
该集群包含一篇详细介绍新问题表述和求解方法的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
Standard
On-topic for AI-industry coverage; kept in the public index.
Story freshness
15 days old
Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

报道来源 [1]

  1. arXiv cs.AI TIER_1 English(EN) · Zeyad Kassem, Adolfo R. Escobedo ·

    基于边缘的连续p-中值问题及其与物流区域划分的联系

    arXiv:2608.11230v1 Announce Type: new Abstract: This paper introduces the edge-based contiguous p-median (ECpM) problem to partition the roads in a network into a given number of compact and contiguous territories. Two binary programming models are introduced, both of which incor…

相关实体

相关话题