Pages that link to "Item:Q4661131"
From MaRDI portal
The following pages link to Efficient heuristics for Median Cycle Problems (Q4661131):
Displaying 14 items.
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
- Modelling and solving central cycle problems with integer programming. (Q1427116) (← links)
- A survey of the standard location-routing problem (Q1698292) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← 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)
- An efficient evolutionary algorithm for the ring star problem (Q2356203) (← links)
- Metaheuristics and cooperative approaches for the bi-objective ring star problem (Q2654392) (← links)
- Insertion heuristics for central cycle problems (Q3057168) (← links)