A heuristic procedure for the capacitated m-ring-star problem
DOI10.1016/J.EJOR.2010.06.030zbMATH Open1206.90202OpenAlexW2004217741MaRDI QIDQ613432FDOQ613432
Authors: Zahra Naji-Azimi, Majid Salari, Paolo Toth 
Publication date: 20 December 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.06.030
Recommendations
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- The Capacitated m-Ring-Star Problem
- Heuristic algorithms for the multi-depot ring-star problem
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem
- An Efficient Heuristic for the Ring Star Problem
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- TSPLIB—A Traveling Salesman Problem Library
- The Capacitated m-Ring-Star Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Heuristic algorithms for the multi-depot ring-star problem
- Locating median cycles in networks
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem
Cited In (25)
- A branch-and-cut for the Non-Disjointm-Ring-Star Problem
- Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
- The caterpillar-packing polytope
- Optimal capacitated ring trees
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- Models for a Steiner multi-ring network design problem with revenues
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- A decomposition algorithm for the ring spur assignment problem
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
- Capacitated \(m\) two-node survivable star problem
- An Efficient Heuristic for the Ring Star Problem
- Heuristic algorithms for the multi-depot ring-star problem
- The capacitated \(m\) two node survivable star problem
- An evolutionary algorithm for the biobjective capacitated \(m\)-ring star problem
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- A branch-and-cut algorithm for the ring spur assignment problem
- A covering traveling salesman problem with profit in the last mile delivery
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
- Generalized local branching heuristics and the capacitated ring tree problem
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- A variable neighborhood search and its application to a ring star problem generalization
- Spatial coverage in routing and path planning problems
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- The Capacitated m-Ring-Star Problem
- An integer programming-based local search for the covering salesman problem
Uses Software
This page was built for publication: A heuristic procedure for the capacitated \(m\)-ring-star problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613432)
