The following pages link to (Q4845371):
Displaying 50 items.
- Spanning trees with variable degree bounds (Q297415) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← links)
- Bounded-degree spanning tree problems: models and new algorithms (Q632386) (← links)
- Optimizing phylogenetic diversity with ecological constraints (Q659637) (← links)
- A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks (Q662130) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- Exact solution approaches for the multi-period degree constrained minimum spanning tree problem (Q724056) (← links)
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- Partial inverse min-max spanning tree problem (Q830941) (← links)
- Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- Network flow models for the local access network expansion problem (Q856692) (← links)
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (Q863567) (← links)
- A branch and bound algorithm for the minimax regret spanning arborescence (Q878227) (← links)
- Minimum power multicasting problem in wireless networks (Q953297) (← links)
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (Q976011) (← links)
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
- Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- Designing reliable tree networks with two cable technologies (Q1291775) (← links)
- The 2-hop spanning tree problem (Q1306467) (← links)
- An exact algorithm for IP column generation (Q1360108) (← links)
- Generalized spanning trees (Q1579496) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
- Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) (← 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)
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol (Q1686055) (← links)
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem (Q1752190) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations (Q1772873) (← links)
- Exact algorithms for the minimum power symmetric connectivity problem in wireless networks (Q1781561) (← links)
- Generalized network design problems. (Q1810478) (← links)
- On Steiner trees and minimum spanning trees in hypergraphs (Q1869998) (← links)
