A branch-and-cut for the Non-Disjointm-Ring-Star Problem

DOI10.1051/ro/2014006zbMath1292.90069OpenAlexW2082449498MaRDI QIDQ5418011

Aurélien Questel, Pierre Fouilhoux

Publication date: 26 May 2014

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2014006

zbMATH Keywords

branch-and-cut algorithmpolyhedral approachnon-disjoint \(m\)-ring-star problemrealistic SDH network

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (1)

The separation problem of rounded capacity inequalities: some polynomial cases

This page was built for publication: A branch-and-cut for the Non-Disjointm-Ring-Star Problem