Pages that link to "Item:Q3315294"

The following pages link to A dual ascent approach for steiner tree problems on a directed graph (Q3315294):

Displayed 25 items.

• 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)
• The Performance of greedy algorithms for the on-line steiner tree and related problems (Q4850333) ‎ (← 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)
• Two-Dimensional Phase Unwrapping via Balanced Spanning Forests (Q5139611) ‎ (← links)
• A distributed dual ascent algorithm for Steiner problems in multicast routing (Q5191138) ‎ (← links)
• Distance Transformation for Network Design Problems (Q5231681) ‎ (← links)
• (Q5708491) ‎ (← 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 (Q5925647) ‎ (← links)
• Dual-based approach for a hub network design problem under non-restrictive policy (Q5938396) ‎ (← links)
• A comparison of Steiner tree relaxations (Q5946825) ‎ (← links)
• Improved algorithms for the Steiner problem in networks (Q5946826) ‎ (← links)
• Heuristic algorithms for packing of multiple-group multicasting (Q5959379) ‎ (← links)
• Matheuristics: survey and synthesis (Q6056873) ‎ (← 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)
• Stronger path‐based extended formulation for the Steiner tree problem (Q6068530) ‎ (← links)
• A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) ‎ (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) ‎ (← links)
• Optimizing the Design of a Wind Farm Collection Network (Q6102753) ‎ (← links)
• Vertex covering with capacitated trees (Q6179715) ‎ (← links)
• Linear-size formulations for connected planar graph partitioning and political districting (Q6181361) ‎ (← links)
• Steiner problems on directed acyclic graphs (Q6183625) ‎ (← links)