Pages that link to "Item:Q299847"

The following pages link to Hop constrained Steiner trees with multiple root nodes (Q299847):

Displaying 14 items.

• Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
• Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
• Multi-level facility location problems (Q1754251) (← links)
• Cost additive rules in minimum cost spanning tree problems with multiple sources (Q2241238) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)
• The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources (Q5072241) (← links)
• Distance Transformation for Network Design Problems (Q5231681) (← links)
• A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)