Pages that link to "Item:Q2840522"

The following pages link to A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q2840522):

Displaying 11 items.

• Optimal capacitated ring trees (Q286687) (← links)
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
• A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
• Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← 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)
• An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem (Q2840722) (← links)
• A decomposition algorithm for the ring spur assignment problem (Q4921258) (← links)
• School bus routing—a column generation approach (Q4980002) (← links)
• A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
• A branch-and-cut for the Non-Disjoint<i>m</i>-Ring-Star Problem (Q5418011) (← links)