SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and bounds
8 references·16 citing·35 second hop
Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and bounds (1985)Lagrangian relaxation for the star‐star c…Location on Networks: Theory and Algorithms (1979)Location on Networks: Theory …A Dual-Based Procedure for Uncapacitated Facility Location (1978)A Dual-Based Procedure for Un…Large-Scale Network Topological Optimization (1977)Large-Scale Network Topologic…A Heuristic Program for Locating Warehouses (1976)A Heuristic Program for Locat…An Efficient Branch and Bound Algorithm for the Warehouse Location Problem (1972)An Efficient Branch and Bound…Warehouse Location Under Continuous Economies of Scale (1966)Warehouse Location Under Cont…A Branch-Bound Algorithm for Plant Location (1966)A Branch-Bound Algorithm for …A Heuristic Program for Locating Warehouses (1963)A Heuristic Program for Locat…A hybrid algorithm for capacitated plant location problem (2010)A hybrid algorithm for capaci…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…Strategic design of distribution systems with economies of scale in transportation (2006)Strategic design of distribut…A branch-and-price algorithm for the capacitated facility location problem (2006)A branch-and-price algorithm …Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation (2005)Lower Bounds for the Capacita…The fixed charge facility location problem with coverage restrictions (2001)The fixed charge facility loc…Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements (2000)Telecommunication Node Cluste…A tabu search heuristic for the concentrator location problem (1998)A tabu search heuristic for t…Accelerating Benders' decomposition for the capacitated facility location problem (1996)Accelerating Benders' decompo…Topological design of a two-level network with ring-star configuration (1993)Topological design of a two-l…A Lagrangian heuristic for the capacitated plant location problem with single source constraints (1993)A Lagrangian heuristic for th…Optimal design of a distributed network with a two-level hierarchical structure (1992)Optimal design of a distribut…Hierarchical concentrator location problem (1992)Hierarchical concentrator loc…Designing satellite communication networks by zero—one quadratic programming (1989)Designing satellite communica…Locating concentrators for primary and secondary coverage in a computer communications network (1988)Locating concentrators for pr…THE MAXIMAL COVERING LOCATION PROBLEM (1974)Discrete location theory (1991)Network and Discrete Location: Models, Algorithms and Applications. (1997)A Simultaneous Inventory Control and Facility Location Model with Stochastic Capacity Constraints (2006)Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example (2006)Combining Lagrangian heuristic and Ant Colony System to solve the Single Source Capacitated Facility Location Problem (2007)Multicommodity Distribution System Design by Benders Decomposition (1974)Tabu Search and Benders Decomposition Approaches for a Capacitated Closed-Loop Supply Chain Network Design Problem (2009)Multicommodity Distribution System Design by Benders Decomposition * † ‡ (2010)Design of Resilient Supply Chains with Risk of Facility Disruptions (2014)Low carbon chance constrained supply chain network design problem: a Benders decomposition based approach (2016)Models of Man. (1959)Planning Production, Inventories, and Work Force. (1962)The simple plant location problem: Survey and synthesis (1983)An Overview of Representative Problems in Location Research (1989)PROCEEDINGS OF THE 1997 WINTER SIMULATION CONFERENCE (1997)Location-Allocation Problems (1963)A branch‐bound algorithm for the capacitated facilities location problem (1969)The capacitated plant location problem (1995)Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems (1987)Improving supply chain disaster preparedness (2005)Location of Health Care Facilities (2005)Efficient algorithms for the capacitated concentrator location problem (1987)Heuristics for the p-hub location problem (1991)Avoiding local optima in thep-hub location problem using tabu search and GRASP (1992)An Analysis of Private and Public Sector Location Models (1970)Facility location models for distribution planning (1985)An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem (1977)Multiple Resource–Constrained Scheduling Using Branch and Bound (1978)A Dual-Based Procedure for Dynamic Facility Location (1982)Network Design and Transportation Planning: Models and Algorithms (1984)Integer programming formulations of discrete hub location problems (1994)Location analysis: A synthesis and survey (2004)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

  • 1978A Dual-Based Procedure for Uncapacitated Facility Location910 cited
  • 1976A Heuristic Program for Locating Warehouses719 cited
  • 1963A Heuristic Program for Locating Warehouses650 cited
  • 1966A Branch-Bound Algorithm for Plant Location423 cited
  • 1972An Efficient Branch and Bound Algorithm for the Warehouse Location Problem291 cited
  • 1966Warehouse Location Under Continuous Economies of Scale282 cited
  • 1979Location on Networks: Theory and Algorithms280 cited
  • 1977Large-Scale Network Topological Optimization271 cited

Cited by

  • 2001The fixed charge facility location problem with coverage restrictions97 cited
  • 1996Accelerating Benders' decomposition for the capacitated facility location problem93 cited
  • 1993A Lagrangian heuristic for the capacitated plant location problem with single source constraints92 cited
  • 2006A branch-and-price algorithm for the capacitated facility location problem81 cited
  • 2007Star p-hub median problem with modular arc capacities75 cited
  • 2007Solving the hub location problem in a star–star network63 cited
  • 1992Optimal design of a distributed network with a two-level hierarchical structure

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

55 cited
  • 1988Locating concentrators for primary and secondary coverage in a computer communications network53 cited
  • 1998A tabu search heuristic for the concentrator location problem47 cited
  • 2006Strategic design of distribution systems with economies of scale in transportation45 cited
  • 2000Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements43 cited
  • 1993Topological design of a two-level network with ring-star configuration43 cited
  • 1992Hierarchical concentrator location problem40 cited
  • 2005Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation39 cited
  • 1989Designing satellite communication networks by zero—one quadratic programming39 cited
  • 2010A hybrid algorithm for capacitated plant location problem38 cited