![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
The hub covering flow problem
The hub covering flow problem (HCFP) seeks to find the minimal cost hub-and-spoke network by optimally locating hub nodes and assigning non-hub nodes to the hub nodes subject to a coverage constraint. The cost...
-
Article
Aggregation error for location models: survey and analysis
Location problems occurring in urban or regional settings may involve many tens of thousands of “demand points,” usually individual private residences. In modeling such problems it is common to aggregate deman...
-
Article
A subgradient algorithm for certain minimax and minisum problems
We present a subgradient algorithm for minimizing the maximum of a finite collection of functions. It is assumed that each function is the sum of a finite collection of basic convex functions and that the numb...