Pages that link to "Item:Q4540078"

The following pages link to Solving Steiner tree problems in graphs to optimality (Q4540078):

Displaying 50 items.

• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
• The Steiner connectivity problem (Q2434988) (← links)
• Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
• Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
• Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
• Viral systems: A new bio-inspired optimisation approach (Q2475843) (← links)
• Towards optimizing the deployment of optical access networks (Q2513732) (← 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)
• Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)
• Dual heuristics on the exact solution of large Steiner problems (Q2741494) (← links)
• Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm (Q2883578) (← links)
• A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
• Dimensioning multicast-enabled communications networks (Q3150132) (← links)
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
• Approaches to the Steiner Problem in Networks (Q3637313) (← links)
• Problem reduction methods and a tree generation algorithm for the steiner network problem (Q3786299) (← links)
• Dynamic Steiner Tree Problem (Q3977293) (← links)
• Solving the Steiner Tree Problem on a Graph Using Branch and Cut (Q4030930) (← links)
• A tabu search heuristic for the Steiner Tree Problem (Q4267398) (← links)
• A branch and cut algorithm for the Steiner problem in graphs (Q4378527) (← links)
• A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs (Q4540054) (← links)
• Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
• Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
• A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
• Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
• (Q4789301) (← links)
• Using multiflow formulations to solve the Steiner tree problem in graphs (Q5002224) (← links)
• An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← links)
• On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
• A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
• Mathematical Programming Algorithms for Spatial Cloaking (Q5137955) (← links)
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
• Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
• Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms (Q5202521) (← links)
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
• A comparison of Steiner tree relaxations (Q5946825) (← links)
• Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
• Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
• Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) (← links)
• Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
• A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
• A branch-and-cut algorithm for the connected max-\(k\)-cut problem (Q6069218) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
• Vertex covering with capacitated trees (Q6179715) (← links)