Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Ordered Median Hub Location Problems with Capacity Constraints (1503.04468v1)

Published 15 Mar 2015 in math.OC and cs.DS

Abstract: The Single Allocation Ordered Median Hub Location problem is a recent hub model introduced in Puerto et al. (2011) that provides a unifying analysis of a wide class of hub location mod- els. In this paper, we deal with the capacitated version of this problem, presenting two formulations as well as some preprocessing phases for fixing variables. In addition, a strengthening of one of these formulations is also studied through the use of some fami- lies of valid inequalities. A battery of test problems with data taken from the AP library are solved where it is shown that the running times have been significantly reduced with the improvements presented in the paper.

Citations (41)

Summary

We haven't generated a summary for this paper yet.