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]. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Régin, J. C., Rousseau, L. M., Rueher, M., & Van Hoeve, W. J. (2010). The weighted spanning tree constraint revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6140 LNCS, pp. 287–291). https://doi.org/10.1007/978-3-642-13520-0_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
