Weighted spanning tree constraint with explanations

DOI10.1007/978-3-319-33954-2_8MaRDI QIDQ2815098zbMATH OpenOpenAlexFDO

Authors Diego de Uña, Graeme Gange, Peter Schachte, Peter J. Stuckey

Publication date 27 June 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-33954-2_8

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35)

Recommendations

• The Weighted Spanning Tree Constraint Revisited
• The Minimum Spanning Tree Constraint
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• The “Not-Too-Heavy Spanning Tree” Constraint
• The minimum weight spanning tree with constraints

Cited in

(5)

• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• Counting weighted spanning trees to solve constrained minimum spanning tree problems
• The “Not-Too-Heavy Spanning Tree” Constraint
• The Weighted Spanning Tree Constraint Revisited
• Compiling CP subproblems to MDDs and d-DNNFs

This page was built for publication: Weighted spanning tree constraint with explanations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815098)