Pages that link to "Item:Q3315294"

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

Displaying 50 items.

• An exact solution framework for the minimum cost dominating tree problem (Q1800452) (← links)
• An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
• Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks (Q1869722) (← links)
• On Steiner trees and minimum spanning trees in hypergraphs (Q1869998) (← links)
• A monotonic, dual-based bounding procedure for integer programs (Q1894724) (← links)
• On the core of the minimum cost Steiner tree game in networks (Q1897387) (← links)
• Steiner tree packing revisited (Q1935940) (← links)
• Strategic cooperation in cost sharing games (Q1939521) (← links)
• Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← links)
• Optimal Steiner trees under node and edge privacy conflicts (Q2156311) (← links)
• Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
• Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems (Q2226969) (← links)
• A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325) (← links)
• Capacitated ring arborescence problems with profits (Q2284638) (← links)
• Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
• Topological design of a two-level network with ring-star configuration (Q2367422) (← links)
• Viral systems: A new bio-inspired optimisation approach (Q2475843) (← links)
• Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
• Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
• Dual heuristics on the exact solution of large Steiner problems (Q2741494) (← links)
• A Practical Greedy Approximation for the Directed Steiner Tree Problem (Q2942396) (← links)
• LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES (Q3021975) (← links)
• THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM (Q3021994) (← links)
• Dimensioning multicast-enabled communications networks (Q3150132) (← links)
• Approaches to the Steiner Problem in Networks (Q3637313) (← links)
• LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
• Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
• An integer programming formulation of the Steiner problem in graphs (Q4031973) (← 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)
• 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)
• Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms (Q5202521) (← 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)