Pages that link to "Item:Q2782729"

The following pages link to A comparative analysis of several formulations for the generalized minimum spanning tree problem (Q2782729):

Displaying 21 items.

• Generalized minimum spanning tree games (Q286691) (← links)
• Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← 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)
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
• Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
• Solving group Steiner problems as Steiner problems. (Q1420439) (← 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)
• Generalized network design problems. (Q1810478) (← 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 Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← 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)
• An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment (Q2642500) (← links)
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← 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)