Pages that link to "Item:Q1827870"

The following pages link to Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870):

Displaying 26 items.

• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
• Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
• A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← links)
• The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465) (← links)
• The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
• Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
• The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions (Q992574) (← links)
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem (Q1651621) (← links)
• Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
• On imposing connectivity constraints in integer programs (Q1683690) (← links)
• Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
• Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
• A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks (Q2011601) (← links)
• Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
• A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025) (← links)
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
• Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (Q2883603) (← links)
• A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM (Q3526525) (← links)
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
• Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)