SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
14 references·16 citing·26 second hop
An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems (1998)An Efficient Procedure for Designing Sing…Tight linear programming relaxations of uncapacitated p-hub median problems (1996)Tight linear programming rela…Hub network design with single and multiple allocation: A computational study (1996)Hub network design with singl…Hub Location and the p-Hub Median Problem (1996)Hub Location and the p-Hub Me…Efficient algorithms for the uncapacitated single allocation p-hub median problem (1996)Efficient algorithms for the …Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System (1995)Networking Policies for Hub-a…The hub network design problem (1994)The hub network design problemOn tabu search for the location of interacting hub facilities (1994)On tabu search for the locati…Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem (1994)Lagrangian relaxation based a…Avoiding local optima in thep-hub location problem using tabu search and GRASP (1992)Avoiding local optima in thep…The Maximal Covering Location Problem with Capacities on Total Workload (1991)The Maximal Covering Location…Heuristics for the p-hub location problem (1991)Heuristics for the p-hub loca…A quadratic integer program for the location of interacting hub facilities (1987)A quadratic integer program f…The Location of Interacting Hub Facilities (1986)The Location of Interacting H…Technical Note—An Algorithm for the p-Median Problem (1977)Technical Note—An Algorithm f…Dynamic Pricing of Relocating Resources in Large Networks (2020)Dynamic Pricing of Relocating…Hub Location Problems (2019)Hub Location ProblemsA Lagrangian heuristic and GRASP for the hub-and-spoke network system with economies-of-scale and congestion (2019)A Lagrangian heuristic and GR…Exact solution of hub network design problems with profits (2017)Exact solution of hub network…Hub Location Problems (2015)Hub Location ProblemsRobust optimization approach to capacitated single and multiple allocation hub location problems (2014)Robust optimization approach …Star p-hub center problem and star p-hub median problem with bounded path lengths (2012)Star p-hub center problem and…Allocation strategies in hub networks (2011)Allocation strategies in hub …Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment (2010)Branch and Price for Large-Sc…Lagrangean relaxation for the capacitated hub location problem with single assignment (2009)Lagrangean relaxation for the…A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion (2009)A Lagrangean Heuristic for Hu…Star p-hub median problem with modular arc capacities (2007)Star p-hub median problem wit…Solving the hub location problem in a star–star network (2007)Solving the hub location prob…Logistics network design with supplier consolidation hubs and multiple shipment options (2007)Logistics network design with…The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic (2006)The hub location and network …Distribution Centres in Supply Chain Operations (2005)Distribution Centres in Suppl…Integer programming formulations of discrete hub location problems (1994)Solution algorithms for the capacitated single allocation hub location problem (1999)Twenty-Five Years of Hub Location Research (2012)Hub location problems: A review of models, classification, solution techniques, and applications (2013)Analyzing trade-offs between transportation, inventory and production costs on freight networks (1985)Deregulating the airlines (1986)Airline network design and hub location problems (1996)Hub Arc Location Problems: Part I—Introduction and Results (2005)An Overview of Representative Problems in Location Research (1989)The Quadratic Assignment Problem (1998)The Market as a Factor in the Localization of Industry in the United States (1954)Multicommodity Distribution System Design by Benders Decomposition * † ‡ (2010)Location-Allocation Problems (1963)Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph (1964)Discrete location theory (1991)Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem (1998)Hub location in backbone/tributary network design: a review (1998)The capacitated multiple allocation hub location problem: Formulations and algorithms (2000)Spatial Interaction Models:Formulations and Applications (1988)An integrative framework for urban tourism research (2001)Location models for airline hubs behaving as M/D/c queues (2003)Hub Location Problems (2002)A geographer's analysis of hub-and-spoke networks (1998)Optimal location of intermodal freight hubs (2004)Facility location models for distribution system design (2004)Network hub location problems: The state of the art (2007)
this work references cited by second hop

References

  • 1987A quadratic integer program for the location of interacting hub facilities955 cited
  • 1986The Location of Interacting Hub Facilities632 cited
  • 1996Efficient algorithms for the uncapacitated single allocation p-hub median problem607 cited
  • 1996Tight linear programming relaxations of uncapacitated p-hub median problems436 cited
  • 1996Hub Location and the p-Hub Median Problem380 cited
  • 1994The hub network design problem330 cited
  • 1994On tabu search for the location of interacting hub facilities248 cited
  • 1992Avoiding local optima in thep-hub location problem using tabu search and GRASP234 cited
  • 1995Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System227 cited
  • 1994Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem224 cited
  • 1991Heuristics for the p-hub location problem224 cited
  • 1996Hub network design with single and multiple allocation: A computational study171 cited
  • 1991The Maximal Covering Location Problem with Capacities on Total Workload171 cited
  • 1977Technical Note—An Algorithm for the p-Median Problem149 cited

Cited by

  • 2009

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
109 cited
  • 2011Allocation strategies in hub networks108 cited
  • 2009Lagrangean relaxation for the capacitated hub location problem with single assignment106 cited
  • 2010Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment97 cited
  • 2015Hub Location Problems96 cited
  • 2012Star p-hub center problem and star p-hub median problem with bounded path lengths77 cited
  • 2006The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic75 cited
  • 2007Star p-hub median problem with modular arc capacities75 cited
  • 2007Logistics network design with supplier consolidation hubs and multiple shipment options66 cited
  • 2007Solving the hub location problem in a star–star network63 cited
  • 2020Dynamic Pricing of Relocating Resources in Large Networks56 cited
  • 2019A Lagrangian heuristic and GRASP for the hub-and-spoke network system with economies-of-scale and congestion55 cited
  • 2014Robust optimization approach to capacitated single and multiple allocation hub location problems54 cited
  • 2005Distribution Centres in Supply Chain Operations52 cited
  • 2017Exact solution of hub network design problems with profits51 cited
  • 2019Hub Location Problems50 cited