Pages that link to "Item:Q702364"
From MaRDI portal
The following pages link to New models of the generalized minimum spanning tree problem (Q702364):
Displaying 25 items.
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds (Q439985) (← links)
- Generalized network design problems. Modeling and optimization. (Q455036) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- The geometric generalized minimum spanning tree problem with grid clustering (Q882648) (← links)
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- Generalized spanning trees (Q1579496) (← links)
- Generalized Steiner problems and other variants (Q1592840) (← links)
- A multigraph formulation for the generalized minimum spanning tree problem (Q1661871) (← links)
- A two-level solution approach for solving the generalized minimum spanning tree problem (Q1681269) (← links)
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles (Q2042074) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708) (← links)
- The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
- On the prize-collecting generalized minimum spanning tree problem (Q2480209) (← links)
- A new relaxation method for the generalized minimum spanning tree problem (Q2575572) (← links)
- The generalized minimum spanning tree: polyhedra and branch-and-cut (Q2741333) (← links)
- A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs (Q2782732) (← links)
- Relaxation methods for the Generalized Minimum Spanning Tree problem (Q2816036) (← links)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
- Selective generalized travelling salesman problem (Q5069320) (← links)
- Network optimization on partitioned pairs of points (Q5136221) (← links)
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)
- An efficient mixed integer linear programming model for the minimum spanning tree problem (Q6162004) (← links)
