Solving large single allocation \(p\)-hub problems with two or three hubs
type: Item
instance of: scholarly article
title: Solving large single allocation \(p\)-hub problems with two or three hubs
zbMATH Open document ID: 0985.90064
DOI: 10.1016/S0377-2217(99)00370-7
author: Jamie Ebery
published in: European Journal of Operational Research
publication date: 2002-06-02T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1563868
zbMATH Keywords: location
zbMATH Keywords: allocation
zbMATH Keywords: linear programming
zbMATH Keywords: branch-and-bound
zbMATH Keywords: nodes
describes a project that uses: CPLEX
MaRDI profile type: Publication
cites work: On the Location of Hub Facilities
cites work: On ``A quadratic integer program for the location of interacting hub facilities''
cites work: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
cites work: Interacting New Facilities and Location-Allocation Problems
cites work: Location and allocation for distribution systems with transshipments and transportion economies of scale
cites work: Integer programming formulations of discrete hub location problems
cites work: Hub Location and the p-Hub Median Problem
cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
cites work: An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: An algorithm for the quadratic assignment problem using Benders' decomposition
cites work: Heuristics for the p-hub location problem
cites work: Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Lower Bounds for the Hub Location Problem
cites work: On tabu search for the location of interacting hub facilities
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
cites work: Neural versus traditional approaches to the location of interacting hub facilities
cites work: A linear program for the two-hub location problem
cites work: Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
cites work: The single allocation problem in the interacting three-hub network
description: scientific article; zbMATH DE number 1563868