Pages that link to "Item:Q4894860"
From MaRDI portal
The following pages link to On the generalized minimum spanning tree problem (Q4894860):
Displayed 39 items.
- Generalized minimum spanning tree games (Q286691) (← links)
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- Looking for edge-equitable spanning trees (Q336753) (← 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)
- An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← 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)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- A two-level solution approach for solving the generalized minimum spanning tree problem (Q1681269) (← links)
- A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Branch-and-bound for the precedence constrained generalized traveling salesman problem (Q1984690) (← links)
- A rapid learning automata-based approach for generalized minimum spanning tree problem (Q2023120) (← links)
- The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem (Q2123564) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
- On the prize-collecting generalized minimum spanning tree problem (Q2480209) (← links)
- (Q2741333) (← links)
- A comparative analysis of several formulations for the generalized minimum spanning tree problem (Q2782729) (← links)
- The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search (Q3057152) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- Approximation Algorithms for Generalized MST and TSP in Grid Clusters (Q3467839) (← links)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
- (Q5136221) (← links)
- (Q5881545) (← links)
- On generalized minimum spanning trees (Q5945860) (← links)
- General variable neighborhood search approach to group Steiner tree problem (Q6063507) (← links)
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search (Q6070498) (← links)
- Continuous approximation formulas for location problems (Q6085881) (← links)
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)