Pages that link to "Item:Q2575572"
From MaRDI portal
The following pages link to A new relaxation method for the generalized minimum spanning tree problem (Q2575572):
Displaying 21 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)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- New models of the generalized minimum spanning tree problem (Q702364) (← 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)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- The tree of hubs location problem (Q1039782) (← links)
- Generalized spanning trees (Q1579496) (← 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 rapid learning automata-based approach for generalized minimum spanning tree problem (Q2023120) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
- A new rule for source connection problems (Q2514781) (← 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)
- A new formulation for spanning trees (Q2840708) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search (Q6070498) (← links)
- An efficient mixed integer linear programming model for the minimum spanning tree problem (Q6162004) (← links)
