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

zbMATH Keywords

communication networksgraph partitioningbranch-and-cuthub-locationsize constrained clique partitioning

Mathematics Subject Classification ID

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)

Solving partitioning-hub location-routing problem using DCA ⋮ An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ An endosymbiotic evolutionary algorithm for the hub location-routing problem ⋮ Size-constrained graph partitioning polytopes ⋮ General network design: a unified view of combined location and network design problems ⋮ Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem ⋮ A fuzzy correlation based heuristic for dual-mode integrated location routing problem ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ Perspectives on modeling hub location problems ⋮ Flow shipment scheduling in an incomplete hub location-routing network design problem ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution ⋮ A bi-objective incomplete hub location-routing problem with flow shipment scheduling ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

Cites Work

• Facets of the clique partitioning polytope
• The partition problem
• Network hub location problems: The state of the art
• The equipartition polytope. II: Valid inequalities and facets
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• Location-area partition in a cellular radio network

This page was built for publication: A branch-and-cut algorithm for the partitioning-hub location-routing problem