The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
From MaRDI portal
Publication:643033
DOI10.1016/j.dam.2011.01.015zbMath1228.90137OpenAlexW2062160763MaRDI QIDQ643033
Yuri Frota, Luidi Simonetti, Cid Carvalho De Souza
Publication date: 27 October 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.015
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (9)
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 ⋮ A survivable variant of the ring star problem ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ Algorithms for the metric ring star problem with fixed edge-cost ratio ⋮ A parallel variable neighborhood search for solving covering salesman problem ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
- A dual ascent approach for steiner tree problems on a directed graph
- The Capacitated m-Ring-Star Problem
- TSPLIB—A Traveling Salesman Problem Library
- The Circuit Polytope: Facets
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Solving Steiner tree problems in graphs to optimality
- Algorithms and Computation
This page was built for publication: The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
