The “Not-Too-Heavy Spanning Tree” Constraint

DOI10.1007/978-3-540-72397-4_5zbMath1214.90121OpenAlexW1691798050MaRDI QIDQ3612407

Irit Katriel, Grégoire Dooms

Publication date: 10 March 2009

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72397-4_5

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (6)

Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint ⋮ Improved filtering for weighted circuit constraints ⋮ Solving the quorumcast routing problem by constraint programming ⋮ Counting weighted spanning trees to solve constrained minimum spanning tree problems ⋮ The weighted arborescence constraint

This page was built for publication: The “Not-Too-Heavy Spanning Tree” Constraint