Efficient heuristics for Median Cycle Problems
From MaRDI portal
Recommendations
Cited in
(14)- Modelling and solving central cycle problems with integer programming.
- A survey of the standard location-routing problem
- Locating median cycles in networks
- General network design: a unified view of combined location and network design problems
- Variable neighbourhood structures for cycle location problems
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- A parallel variable neighborhood search for solving covering salesman problem
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
- A covering traveling salesman problem with profit in the last mile delivery
- Spatial coverage in routing and path planning problems
- An efficient evolutionary algorithm for the ring star problem
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- Insertion heuristics for central cycle problems
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
This page was built for publication: Efficient heuristics for Median Cycle Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4661131)