The Weighted Spanning Tree Constraint Revisited
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3980505
- Weighted spanning tree constraint with explanations
- On the weight-constrained minimum spanning tree problem
- The minimum weight spanning tree with constraints
- The multi-weighted spanning tree problem
- Counting weighted spanning trees to solve constrained minimum spanning tree problems
- The “Not-Too-Heavy Spanning Tree” Constraint
- On the spanning trees of weighted graphs
- scientific article; zbMATH DE number 1086911
Cited in
(12)- The \textsc{WeightedCircuitsLmax} constraint
- Counting weighted spanning trees to solve constrained minimum spanning tree problems
- The weighted arborescence constraint
- The salesman and the tree: the importance of search in CP
- Weighted spanning tree constraint with explanations
- Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks
- On the weight-constrained minimum spanning tree problem
- A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
- The “Not-Too-Heavy Spanning Tree” Constraint
- Improved filtering for weighted circuit constraints
- Weighted matching as a generic pruning technique applied to optimization constraints
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
This page was built for publication: The Weighted Spanning Tree Constraint Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569939)