Pages that link to "Item:Q4458720"

The following pages link to The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720):

Displaying 23 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)
• Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach (Q829168) (← 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 minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (Q2230399) (← links)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
• The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
• The generalized minimum spanning tree: polyhedra and branch-and-cut (Q2741333) (← links)
• A comparative analysis of several formulations for the generalized minimum spanning tree problem (Q2782729) (← links)
• Generalized network design polyhedra (Q3100692) (← links)
• (Q3638643) (← links)
• (Q4448919) (← links)
• Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm (Q4679783) (← links)
• (Q5314095) (← links)
• (Q5392237) (← 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)