Pages that link to "Item:Q5945860"

The following pages link to On generalized minimum spanning trees (Q5945860):

Displaying 22 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)
• Locating active sensors on traffic networks (Q816421) (← links)
• Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
• On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
• The geometric generalized minimum spanning tree problem with grid clustering (Q882648) (← links)
• 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)
• Generalized network design problems. (Q1810478) (← links)
• On minimum leaf spanning trees and a criticality notion (Q2182204) (← 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)
• On the prize-collecting generalized minimum spanning tree problem (Q2480209) (← links)
• A new relaxation method for the generalized minimum spanning tree problem (Q2575572) (← links)
• The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search (Q3057152) (← links)
• On recursive computation of minimum spanning trees for special partial graphs (Q3690607) (← links)
• (Q3741632) (← links)
• (Q4448919) (← links)
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
• (Q4508378) (← links)
• (Q5314095) (← links)
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)