SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A tabu search heuristic for the concentrator location problem
10 references·7 citing·32 second hop
A tabu search heuristic for the concentrator location problem (1998)A tabu search heuristic for the concentra…Lagrangean heuristics for location problems (1993)Lagrangean heuristics for loc…Discrete location theory (1991)Discrete location theoryLocating concentrators for primary and secondary coverage in a computer communications network (1988)Locating concentrators for pr…Efficient algorithms for the capacitated concentrator location problem (1987)Efficient algorithms for the …A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints (1986)A Lagrangian Relaxation Heuri…Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and bounds (1985)Lagrangian relaxation for the…Large-Scale Network Topological Optimization (1977)Large-Scale Network Topologic…An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem (1977)An Efficient Branch and Bound…A Heuristic Program for Locating Warehouses (1976)A Heuristic Program for Locat…A Heuristic Program for Locating Warehouses (1963)A Heuristic Program for Locat…Fixed-Charge Facility Location Problems (2015)Fixed-Charge Facility Locatio…Solution method for the location planning problem of logistics park with variable capacity (2012)Solution method for the locat…Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem (2012)Lagrangian Bounds and a Heuri…A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems (2008)A cross entropy-based metaheu…Lower and upper bounds for a two-level hierarchical location problem in computer networks (2006)Lower and upper bounds for a …On the capacitated concentrator location problem: a reformulation by discretization (2004)On the capacitated concentrat…Genetic Algorithms for the Single Source Capacitated Location Problem (2003)Genetic Algorithms for the Si…An Efficient Branch and Bound Algorithm for the Warehouse Location Problem (1972)Multiple Resource–Constrained Scheduling Using Branch and Bound (1978)The capacitated plant location problem (1995)Capacitated warehouse location model with risk pooling (2008)A Dual-Based Procedure for Uncapacitated Facility Location (1978)The simple plant location problem: Survey and synthesis (1983)On the exact solution of large-scale simple plant location problems (1989)Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System (1996)An exact method for the two-echelon, single-source, capacitated facility location problem (2000)Models of Man. (1959)Planning Production, Inventories, and Work Force. (1962)An Overview of Representative Problems in Location Research (1989)PROCEEDINGS OF THE 1997 WINTER SIMULATION CONFERENCE (1997)Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (1977)A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution (1998)Planning and coordination of production and distribution facilities for multiple commodities (2001)On the use of genetic algorithms to solve location problems (2002)Heuristics for the p-hub location problem (1991)Avoiding local optima in thep-hub location problem using tabu search and GRASP (1992)A Lagrangian heuristic for the capacitated plant location problem with single source constraints (1993)Accelerating Benders' decomposition for the capacitated facility location problem (1996)The fixed charge facility location problem with coverage restrictions (2001)The Maximal Covering Location Problem with Capacities on Total Workload (1991)Hub facility location with fixed costs (1992)Hierarchical concentrator location problem (1992)Locating concentrators in centralized computer networks (1992)Optimal switch location in mobile communication networks using hybrid genetic algorithms (2007)Integer programming formulations of discrete hub location problems (1994)Quantitative models for reverse logistics: A review (1997)Green supply‐chain management: A state‐of‐the‐art literature review (2007)Chapter 58 Agglomeration and economic geography (2004)The p-median problem: A survey of metaheuristic approaches (2006)
this work references cited by second hop

References

  • 1991Discrete location theory1,284 cited
  • 1976A Heuristic Program for Locating Warehouses719 cited
  • 1963A Heuristic Program for Locating Warehouses650 cited
  • 1993Lagrangean heuristics for location problems351 cited
  • 1977Large-Scale Network Topological Optimization271 cited
  • 1977An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem243 cited
  • 1987Efficient algorithms for the capacitated concentrator location problem184 cited
  • 1986A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints171 cited
  • 1985Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and bounds102 cited
  • 1988Locating concentrators for primary and secondary coverage in a computer communications network53 cited

Cited by

  • 2015Fixed-Charge Facility Location Problems45 cited
  • 2004On the capacitated concentrator location problem: a reformulation by discretization42 cited
  • 2006Lower and upper bounds for a two-level hierarchical location problem in computer networks33 cited
  • 2012Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem28 cited
  • 2008

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

A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems
25 cited
  • 2012Solution method for the location planning problem of logistics park with variable capacity20 cited
  • 2003Genetic Algorithms for the Single Source Capacitated Location Problem18 cited