Pages that link to "Item:Q613432"
From MaRDI portal
The following pages link to A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432):
Displaying 16 items.
- Optimal capacitated ring trees (Q286687) (← links)
- 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)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak (Q2070131) (← 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)
- A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization (Q2883580) (← links)
- A decomposition algorithm for the ring spur assignment problem (Q4921258) (← links)
- The capacitated m two node survivable star problem (Q4987700) (← links)
- Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope (Q5244302) (← links)
- A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
- The caterpillar-packing polytope (Q5916056) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)