Pages that link to "Item:Q5326781"

The following pages link to A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781):

Displaying 3 items.

• Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (Q1651527) (← links)
• Min–max optimization of node‐targeted attacks in service networks (Q6196869) (← links)