Pages that link to "Item:Q439317"
From MaRDI portal
The following pages link to An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317):
Displaying 11 items.
- Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- An integer programming-based local search for the covering salesman problem (Q1761202) (← 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 based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← 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)
