Pages that link to "Item:Q299847"

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

Displaying 8 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)