Pages that link to "Item:Q882648"
From MaRDI portal
The following pages link to The geometric generalized minimum spanning tree problem with grid clustering (Q882648):
Displaying 7 items.
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- A two-level solution approach for solving the generalized minimum spanning tree problem (Q1681269) (← links)
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Approximation Algorithms for Generalized MST and TSP in Grid Clusters (Q3467839) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
