A branch-and-cut algorithm for the partitioning-hub location-routing problem

DOI10.1016/J.COR.2010.07.014MaRDI QIDQ709201zbMATH OpenOpenAlexFDO

Authors Daniele Catanzaro, Eric Gourdin, Martine Labbé, 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

graph partitioningbranch-and-cutcommunication networkshub-locationsize constrained clique partitioning

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Communication networks in operations research (90B18) Discrete location and assignment (90B80) Network protocols (68M12)

Recommendations

• Solving partitioning-hub location-routing problem using DCA
• A branch-and-cut algorithm for the hub location and routing problem
• A branch and cut algorithm for hub location problems with single assignment
• The tree of hubs location problem
• The hub location and routing problem

Cites work

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

Cited in

(16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709201)