The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach

DOI10.1016/j.cor.2017.06.016zbMath1391.90420OpenAlexW2701289163MaRDI QIDQ1651527

Shahin Gelareh, Rahimeh Neamatian Monemi

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/412526/1/RSAP_Rahimeh_Neamatian_Monemi.pdf

zbMATH Keywords

location-allocationbranch-and-cutnext-generation telecommunications networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Uses Software

• SNDlib
• Concorde
• FEASPUMP

Cites Work

• Unnamed Item
• A branch-and-cut algorithm for the hub location and routing problem
• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• The feasibility pump
• Improved Formulations for the Ring Spur Assignment Problem
• Odd Minimum Cut-Sets and b-Matchings
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Solving the Orienteering Problem through Branch-and-Cut
• A branch-and-cut algorithm for the plant-cycle location problem
• A decomposition algorithm for the ring spur assignment problem
• A branch‐and‐cut algorithm for the ring spur assignment problem
• An efficient search algorithm to find the elementary circuits of a graph

This page was built for publication: The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach