Pages that link to "Item:Q3593370"
From MaRDI portal
The following pages link to Lower and upper bounds for the degree-constrained minimum spanning tree problem (Q3593370):
Displaying 28 items.
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- The salesman and the tree: the importance of search in CP (Q272000) (← links)
- Spanning trees with variable degree bounds (Q297415) (← links)
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Exact solution approaches for the multi-period degree constrained minimum spanning tree problem (Q724056) (← links)
- Degree-bounded minimum spanning tree for unit disk graph (Q764345) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
- Design of capacitated degree constrained min-sum arborescence (Q2085507) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH (Q2790350) (← links)
- Spanning trees with node degree cependent costs and knapsack reformulations (Q2861520) (← links)
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm (Q2883578) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
- Exact algorithms for the vertex separator problem in graphs (Q3008917) (← links)
- Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
- MaxMin allocation via degree lower-bounded arborescences (Q5172749) (← links)
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion (Q5191135) (← links)
- Further contributions to network optimization (Q5487817) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems (Q6564769) (← links)
