Pages that link to "Item:Q3128200"

The following pages link to Steiner Trees for Terminals Constrained to Curves (Q3128200):

Displaying 9 items.

• Directional derivative of the weight of a minimal filling in Riemannian manifolds (Q493881) (← links)
• On the restricted 1-Steiner tree problem (Q2019490) (← links)
• Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
• On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
• On the history of the Euclidean Steiner tree problem (Q2249438) (← links)
• A polynomial algorithm for a constrained traveling salesman problem (Q2748381) (← links)
• An overview of exact algorithms for the Euclidean Steiner tree problem in<i>n</i>-space (Q2827758) (← links)
• THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916) (← links)
• A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ (Q6080617) (← links)