An exact algorithm for solving the ring star problem

DOI10.1080/02331930903500332zbMath1184.90021OpenAlexW1997233793MaRDI QIDQ3553757

Safia Kedad-Sidhoum, Viet Hung Nguyen

Publication date: 21 April 2010

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930903500332

zbMATH Keywords

mixed integer programmingnetwork designbranch-and-cutpolyhedral analysis

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (9)

MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem ⋮ A survivable variant of the ring star problem ⋮ The caterpillar-packing polytope ⋮ Multiple depot ring star problem: a polyhedral study and an exact algorithm ⋮ Securely Connected Facility Location in Metric Graphs ⋮ A parallel variable neighborhood search for solving covering salesman problem ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope ⋮ An efficient evolutionary algorithm for the ring star problem

Cites Work

• Unnamed Item
• Variable neighborhood tabu search and its application to the median cycle problem.
• Locating median cycles in networks
• The Capacitated m-Ring-Star Problem
• Odd Minimum Cut Sets and b-Matchings Revisited
• Odd Minimum Cut-Sets and b-Matchings
• The Circuit Polytope: Facets
• The Ring Star Problem: Polyhedral analysis and exact algorithm

This page was built for publication: An exact algorithm for solving the ring star problem