The following pages link to Trees and Cuts (Q3674420):
Displayed 26 items.
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Hypergraphic submodular function minimization (Q393937) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach (Q829168) (← links)
- An efficient algorithm for the minimum capacity cut problem (Q922927) (← links)
- Minimum power multicasting problem in wireless networks (Q953297) (← links)
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
- Boolean polynomials and set functions (Q1310196) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
- Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
- A note on the generalized Steiner tree polytope (Q1962028) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem (Q2168733) (← links)
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (Q2230399) (← links)
- A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
- Modeling and solving the angular constrained minimum spanning tree problem (Q2329732) (← links)
- Separation of partition inequalities with terminals (Q2386198) (← links)
- Network reinforcement (Q2583121) (← links)
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
- Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)