Pages that link to "Item:Q2286911"
From MaRDI portal
The following pages link to The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911):
Displaying 14 items.
- Partial inverse min-max spanning tree problem (Q830941) (← links)
- The geometric generalized minimum spanning tree problem with grid clustering (Q882648) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- (Q3638643) (← links)
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm (Q4679783) (← links)
- (Q5392237) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search (Q6070498) (← links)
- Research trends in combinatorial optimization (Q6091419) (← 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)
- A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)
- The multicolored graph realization problem (Q6558680) (← links)
- On the enumeration of non-dominated spanning trees with imprecise weights (Q6587937) (← links)
