The Ring Star Problem: Polyhedral analysis and exact algorithm
From MaRDI portal
Publication:4474293
DOI10.1002/NET.10114zbMATH Open1053.90021OpenAlexW2133241632MaRDI QIDQ4474293FDOQ4474293
Martine Labbé, Juan-José Salazar-González, Inmaculada Rodríguez-Martín, G. Laporte
Publication date: 4 August 2004
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10114
Recommendations
- An exact algorithm for solving the ring star problem
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- The Capacitated m-Ring-Star Problem
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- A branch-and-cut algorithm for the ring spur assignment problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Paths and cycles (05C38) Communication networks in operations research (90B18)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood tabu search and its application to the median cycle problem.
- Location-Allocation Problems
- On the facial structure of set packing polyhedra
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- The Covering Tour Problem
- Title not available (Why is that?)
- On the \(p\)-median polytope
- Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
- The Circuit Polytope: Facets
Cited In (60)
- A branch-and-cut for the Non-Disjointm-Ring-Star Problem
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem
- Branch‐and‐cut algorithms for the ‐arborescence star problem
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
- The single-vehicle two-echelon one-commodity pickup and delivery problem
- Continuous maximal covering location problems with interconnected facilities
- An exact algorithm for solving the ring star problem
- Survivability in hierarchical telecommunications networks
- The tree of hubs location problem
- Optimal capacitated ring trees
- Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth
- A heuristic procedure for the capacitated \(m\)-ring-star problem
- Multiperiod location-routing with decoupled time scales
- 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
- A branch-and-cut algorithm for the plant-cycle location problem
- A branch‐and‐cut algorithm for the ring spur assignment problem
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- General network design: a unified view of combined location and network design problems
- Tight bounds from a path based formulation for the tree of hub location problem
- A decomposition algorithm for the ring spur assignment problem
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs
- The capacitated directed cycle hub location and routing problem under congestion
- The periodic vehicle routing problem with driver consistency
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
- The tree-star problem: a formulation and a branch-and-cut algorithm
- An Efficient Heuristic for the Ring Star Problem
- Heuristic algorithms for the multi-depot ring-star problem
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- Single string planning problem arising in liner shipping industries: a heuristic approach
- Steiner networks with unicyclic connected components
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- Algorithms for the metric ring star problem with fixed edge-cost ratio
- A branch-and-cut algorithm for two-level survivable network design problems
- The attractive traveling salesman problem
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- Exact and heuristic approaches for the cycle hub location problem
- A parallel variable neighborhood search for solving covering salesman problem
- A covering traveling salesman problem with profit in the last mile delivery
- Upper and lower bounding procedures for the minimum caterpillar spanning problem
- Configuration‐based approach for topological problems in the design of wireless sensor networks
- Towards optimizing the deployment of optical access networks
- The \(p\)-arborescence star problem: formulations and exact solution approaches
- Networks with unicyclic connected components and without short cycles
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- A variable neighborhood search and its application to a ring star problem generalization
- Spatial coverage in routing and path planning problems
- An integer programming-based local search for the covering salesman problem
- An efficient evolutionary algorithm for the ring star problem
- Securely Connected Facility Location in Metric Graphs
- The capacitated m two node survivable star problem
- The caterpillar-packing polytope
- The caterpillar-packing polytope
- A survivable variant of the ring star problem
- Modeling and solving the two-level generalized median tour problem
Uses Software
This page was built for publication: The Ring Star Problem: Polyhedral analysis and exact algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474293)
