Pages that link to "Item:Q1043363"
From MaRDI portal
The following pages link to Heuristic algorithms for the multi-depot ring-star problem (Q1043363):
Displaying 12 items.
- Models for a Steiner multi-ring network design problem with revenues (Q301388) (← 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)
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← 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 variable neighborhood search based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- An efficient evolutionary algorithm for the ring star problem (Q2356203) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
