An exact algorithm for solving the ring star problem

DOI10.1080/02331930903500332MaRDI QIDQ3553757zbMATH OpenOpenAlexFDO

Authors S. 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

branch-and-cutmixed integer programmingnetwork designpolyhedral analysis

Mathematics Subject Classification ID

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

Recommendations

• The Ring Star Problem: Polyhedral analysis and exact algorithm
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• Algorithms for the 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

Cites work

• scientific article; zbMATH DE number 1453000 (Why is no real title available?)
• Locating median cycles in networks
• Odd Minimum Cut Sets and b-Matchings Revisited
• Odd Minimum Cut-Sets and b-Matchings
• The Capacitated m-Ring-Star Problem
• The Circuit Polytope: Facets
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Variable neighborhood tabu search and its application to the median cycle problem.

Cited in

(19)

• Algorithms for the ring star problem
• An algorithmic framework for the exact solution of tree-star problems
• 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
• A branch-and-price algorithm for the ring-tree facility location problem
• An efficient evolutionary algorithm for the ring star problem
• Corrigendum to ``An efficient evolutionary algorithm for the ring star problem
• MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• Securely connected facility location in metric graphs
• Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
• The caterpillar-packing polytope
• A survivable variant of the ring star problem
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• Survivable two-fault-tolerant ring star problem
• A general cut-generating strategy for the caterpillar-packing polytope
• A resilient variant of the ring star problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553757)