Pages that link to "Item:Q1181904"

The following pages link to Facets of two Steiner arborescence polyhedra (Q1181904):

Displaying 8 items.

• Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
• Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
• A note on the generalized Steiner tree polytope (Q1962028) (← links)
• A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks (Q2011601) (← links)
• Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
• A branch-and-cut algorithm for the connected max-\(k\)-cut problem (Q6069218) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)