Pages that link to "Item:Q1201819"

The following pages link to Steiner's problem in graphs: Heuristic methods (Q1201819):

Displaying 9 items.

• Combinatorial optimization in system configuration design (Q1027725) (← links)
• Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
• Generalized spanning trees (Q1579496) (← links)
• A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
• Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
• Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
• A heuristic for the Steiner problem in graphs (Q1918915) (← links)
• Optimal Steiner trees under node and edge privacy conflicts (Q2156311) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)