An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem

DOI10.1016/j.endm.2011.05.047zbMath1268.68035OpenAlexW2044250224MaRDI QIDQ2840722

Paula Zabala, Hernán Berinsky

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.047

zbMATH Keywords

integer programmingnetwork designbranch-and-cut\(m\)-ring-star

Mathematics Subject Classification ID

Integer programming (90C10) Network design and communication in computer systems (68M10)

Related Items (1)

Models for a Steiner multi-ring network design problem with revenues

Uses Software

• VRP

Cites Work

• The Vehicle Routing Problem
• The Capacitated m-Ring-Star Problem
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem

This page was built for publication: An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem