Allocating nodes to hubs for minimizing the hubs processing resources: A case study

DOI10.1051/ro/2017065zbMath1423.90044OpenAlexW2754448836MaRDI QIDQ5242266

Ali Balma, Mehdi Mrad

Publication date: 6 November 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2017065

zbMATH Keywords

combinatorial optimizationtelecommunicationsgraphs and networksreformulation-linearization techniquenon-linear programminghub allocation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Communication networks in operations research (90B18) Case-oriented studies in operations research (90B90) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Related Items (1)

Tight lower bounds for the traveling salesman problem with draft limits

Cites Work

• Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
• The \(p\)-hub center allocation problem
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• Solution algorithms for the capacitated single allocation hub location problem
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• On the single-assignment \(p\)-hub center problem
• New modeling approaches for the design of local access transport area networks
• General network design: a unified view of combined location and network design problems
• Tight compact models and comparative analysis for the prize collecting Steiner tree problem
• Solving a capacitated hub location problem
• Solving the hub location problem with modular link capacities
• Network hub location problems: The state of the art
• Capacitated single allocation hub location problem-A bi-criteria approach
• A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
• Exactly solving a two-level location problem with modular node capacities
• Benders Decomposition for Large-Scale Uncapacitated Hub Location
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

This page was built for publication: Allocating nodes to hubs for minimizing the hubs processing resources: A case study