A branch-and-cut algorithm for the partitioning-hub location-routing problem
DOI10.1016/j.cor.2010.07.014zbMath1231.90265OpenAlexW2134567220MaRDI QIDQ709201
Daniele Catanzaro, Martine Labbé, Eric Gourdin, F. Aykut Özsoy
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.014
communication networksgraph partitioningbranch-and-cuthub-locationsize constrained clique partitioning
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Discrete location and assignment (90B80) Network protocols (68M12)
Related Items (15)
Cites Work
This page was built for publication: A branch-and-cut algorithm for the partitioning-hub location-routing problem