Pages that link to "Item:Q2840722"

The following pages link to An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem (Q2840722):

Displaying 13 items.

• Optimal capacitated ring trees (Q286687) (← links)
• Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
• Capacitated \(m\) two-node survivable star problem (Q325452) (← links)
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
• Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
• A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (Q1651527) (← links)
• Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← links)
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q2840522) (← links)
• The Capacitated <i>m</i>-Ring-Star Problem (Q3392143) (← links)
• A branch-and-cut for the Non-Disjoint<i>m</i>-Ring-Star Problem (Q5418011) (← links)