An Efficient Heuristic for the Ring Star Problem
From MaRDI portal
Recommendations
- A heuristic procedure for the capacitated m-ring-star problem
- Heuristic algorithms for the multi-depot ring-star problem
- A variable neighborhood search and its application to a ring star problem generalization
- Algorithms for the ring star problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
Cited in
(13)- Variable neighbourhood search: Methods and applications
- Heuristic algorithms for the multi-depot ring-star problem
- Algorithms for the metric ring star problem with fixed edge-cost ratio
- An efficient evolutionary algorithm for the ring star problem
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- A variable neighborhood search and its application to a ring star problem generalization
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
- Two-node-connected star problem
- Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
- The caterpillar-packing polytope
- A heuristic procedure for the capacitated m-ring-star problem
- A general cut-generating strategy for the caterpillar-packing polytope
- Variable neighbourhood search: methods and applications
This page was built for publication: An Efficient Heuristic for the Ring Star Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307528)