A new compact formulation for uncapacitated single-allocation hub location problems with
fewer variables than the previous Integer Linear Programming formulations in the literature …

The design of hub-and-spoke transport networks is a strategic planning problem, as the
choice of hub locations has to remain unchanged for long time periods. However, strikes …

This paper considers the single allocation hub location problem under demand uncertainty
where the allocation of the spokes to the hubs is optimized as second stage decision after …

The hub location problem (HLP) is a special type of the facility location problem with
numerous applications in the airline industry, postal services, and computer and …

If shipments have to be transported between many sources and sinks, direct connections
from each source to each sink are often too expensive. Instead, a small number of nodes are …

Binary quadratic programming (BQP) is a class of combinatorial optimization problems
comprising binary variables, quadratic objective functions, and linear/nonlinear constraints …

Recently, a new model for the uncapacitated single allocation p‐hub median problem was
defined, which uses a more realistic cost structure. Instead of measuring the transport costs …

The hub location problem has gained attention over the last decades. In telecommunications
network, a hub is a place of concurrence in where the work of the network is centralized with …

We address a new version of the Uncapacitated Single Allocation p-Hub Median Problem
(USApHMP) in which transportation costs on each arc are given by piecewise constant cost …

Transport networks with hub structure organise the exchange of shipments between many
sources and sinks. All sources and sinks are connected to a small number of hubs which …