The weighted spanning tree constraint revisited

Authors:
Jean-Charles Régin;Louis-Martin Rousseau;Michel Rueher;Willem-Jan van Hoeve
Affiliations:
I3S, CNRS, University of Nice-Sophia Antipolis;CIRRELT, University of Montreal;I3S, CNRS, University of Nice-Sophia Antipolis;Tepper School of Business, Carnegie Mellon University
Venue:
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2010

Citing 6
Cited 1

Introduction to algorithms

Introduction to algorithms
Verification and sensitivity analysis of minimum spanning trees in linear time

SIAM Journal on Computing
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees

Journal of the ACM (JACM)
The "Not-Too-Heavy Spanning Tree" Constraint

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Simpler and incremental consistency checking and arc consistency filtering algorithms for the weighted spanning tree constraint

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems

Improved filtering for weighted circuit constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

The weighted spanning tree constraint, or wst-constraint, is defined on an edgeweighted graph G and a value K. It states that G admits a spanning tree with weight at most K [3, 4]. It can be applied to network design problems as well as routing problems, in which it serves as a relaxation. In this work, we assume that we can represent the mandatory and possible edges that can belong to a solution to the wst-constraint, e.g., using a subset-bound set variable as in [3].