Solving the hub location problem with modular link capacities
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Star p-hub median problem with modular arc capacities
Computers and Operations Research
On graph-based characteristics of optimal overlay topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
A conditional p-hub location problem with attraction functions
Computers and Operations Research
Solving the hub location problem with modular link capacities
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
INFORMS Journal on Computing
Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Star p-hub center problem and star p-hub median problem with bounded path lengths
Computers and Operations Research
A study of the quadratic semi-assignment polytope
Discrete Optimization
Release Time Scheduling and Hub Location for Next-Day Delivery
Operations Research
A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider two formulations for the uncapacitated hub location problem with single assignment (UHL), which use multicommodity flow variables. We project out the flow variables and determine some extreme rays of the projection cones. Then we investigate whether the corresponding inequalities define facets of the UHL polyhedron. We also present two families of facet defining inequalities that dominate some projection inequalities. Finally, we derive a family of valid inequalities that generalizes the facet defining inequalities and that can be separated in polynomial time. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(2), 84–93 2004