Pages that link to "Item:Q643033"

The following pages link to The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033):

Displaying 16 items.

• Corrigendum to ``An efficient evolutionary algorithm for the ring star problem'' (Q319773) (← links)
• MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
• The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465) (← links)
• A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
• Algorithms for the ring star problem (Q1708589) (← links)
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
• A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
• A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
• Spatial coverage in routing and path planning problems (Q2083923) (← links)
• An efficient evolutionary algorithm for the ring star problem (Q2356203) (← links)
• Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
• The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293) (← links)
• A branch-and-cut for the Non-Disjoint<i>m</i>-Ring-Star Problem (Q5418011) (← links)
• A survivable variant of the ring star problem (Q6196876) (← links)