Pages that link to "Item:Q2714906"
From MaRDI portal
The following pages link to A branch and cut method for the degree-constrained minimum spanning tree problem (Q2714906):
Displayed 16 items.
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Spanning trees with variable degree bounds (Q297415) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm (Q1666108) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Design of capacitated degree constrained min-sum arborescence (Q2085507) (← links)
- Degree-constrained \(k\)-minimum spanning tree problem (Q2221985) (← links)
- A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)