HubLocator: An exact solution method for the multiple allocation hub location problem
From MaRDI portal
Publication:5959392
DOI10.1016/S0305-0548(01)00080-6zbMath1001.90044OpenAlexW1991690336MaRDI QIDQ5959392
Publication date: 2 January 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00080-6
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (18)
New formulations for the uncapacitated multiple allocation hub location problem ⋮ Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Solving a capacitated hub location problem ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ An exact solution procedure for a cluster hub location problem ⋮ Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique ⋮ Allocation strategies in hub networks ⋮ Matheuristics for optimizing the network in German wagonload traffic ⋮ Preprocessing and cutting for multiple allocation hub location problems. ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Network hub location problems: The state of the art ⋮ Facility location models for distribution system design ⋮ Exact procedures for solving the discrete ordered median problem ⋮ The tree of hubs location problem ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems ⋮ Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
Cites Work
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- A linear program for the two-hub location problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Solution approaches to hub location problems
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Solving large single allocation \(p\)-hub problems with two or three hubs
- A hybrid heuristic for the uncapacitated hub location problem
- On the selection of hub airports for an airline hub-and-spoke system
- A Dual-Based Procedure for Uncapacitated Facility Location
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Neural versus traditional approaches to the location of interacting hub facilities
- A dual algorithm for the uncapacitated hub location problem
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Lower Bounds for the Hub Location Problem
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- The single allocation problem in the interacting three-hub network
This page was built for publication: HubLocator: An exact solution method for the multiple allocation hub location problem
