The "Not-Too-Heavy Spanning Tree" Constraint

Grégoire Dooms,Irit Katriel

INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, PROCEEDINGS（2007）

引用 11|浏览0

暂无评分

摘要

We develop filtering algorithms for the Weight-Bounded Spanning Tree (WBST(G,T,I,W)) constraint, which is defined on undirected graph variables Gand T, a scalar variable Iand a vector of scalar variables W. It specifies that Tis a spanning tree of Gwhose total weight is at most I, where Wis a vector of the edge weights.

查看译文

关键词

weight-bounded spanning tree,undirected graph variable,edge weight,scalar variable iand,gwhose total weight,scalar variable,not-too-heavy spanning tree,spanning tree

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要