Pages that link to "Item:Q4458720"
From MaRDI portal
The following pages link to The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720):
Displaying 13 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)
- 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)
- 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)
- The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← 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)
- Generalized network design polyhedra (Q3100692) (← 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)
