The ring/κ‐rings network design problem: Model and branch‐and‐cut algorithm

DOI10.1002/net.21687zbMath1390.90185OpenAlexW2467007820MaRDI QIDQ4642409

Juan-José Salazar-González, Hande Yaman, Inmaculada Rodríguez-Martín

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/36951

zbMATH Keywords

valid inequalitiesring networksnetwork designbranch-and-cut

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items (3)

A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours ⋮ Facility location with tree topology and radial distance constraints ⋮ Perspectives on modeling hub location problems

This page was built for publication: The ring/κ‐rings network design problem: Model and branch‐and‐cut algorithm