Solving the hub location problem with modular link capacities

DOI10.1016/j.cor.2004.05.009zbMath1178.90221OpenAlexW2139099611MaRDI QIDQ2387305

Hande Yaman, Giuliana Carello

Publication date: 2 September 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

Tabu searchBranch and cutHub locationHeuristic concentration

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

New complexity results for the \(p\)-hub median problem, Multiple allocation hub-and-spoke network design under hub congestion, A conditional \(p\)-hub location problem with attraction functions, Multi-product capacitated single-allocation hub location problems: formulations and inequalities, Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion, An exact algorithm for the modular hub location problem with single assignments, Heuristics for the capacitated modular hub location problem, A mixed-integer approach to Core-Edge design of storage area networks, Skyport location problem for urban air mobility system, Hub location problem considering spoke links with incentive-dependent capacities, Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure, A parallel adaptive memory algorithm for the capacitated modular hub location problem, Public transportation hub location with stochastic demand: an improved approach based on multiple attribute group decision-making, Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem, HUBBI: iterative network design for incomplete hub location problems, Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods, Lower and upper bounds for a two-level hierarchical location problem in computer networks, Star \(p\)-hub median problem with modular arc capacities, Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation, Less is more: general variable neighborhood search for the capacitated modular hub location problem, Network hub location problems: The state of the art, Heuristics for the dynamic facility location problem with modular capacities, A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels, Allocating nodes to hubs for minimizing the hubs processing resources: A case study

Uses Software

• ABACUS
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Heuristic concentration: Two stage solution construction
• Solution algorithms for the capacitated single allocation hub location problem
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
• Concentrator location in telecommunications networks.
• On the Design Problem of Multitechnology Networks
• Solving the Hub location problem in telecommunication network design: A local search approach
• Tabu Search—Part I
• Tabu Search—Part II
• Topological Design of Two-Level Telecommunication Networks with Modular Switches
• Topological expansion of multiple-ring metropolitan area networks
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization