Skip to main content

3 Result(s)

within T. J. Lowe Remove this filter

and

  1. No Access

    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...

    J. A. Chatelon, D. W. Hearn, T. J. Lowe in Mathematical Programming (1978)

  2. No Access

    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...

    R. L. Francis, T. J. Lowe, M. B. Rayco, A. Tamir in Annals of Operations Research (2009)

  3. No Access

    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...

    T J Lowe, T Sim in Journal of the Operational Research Society (2013)