SZodixStudyAcademic Library
DashboardShelvesOpen accessMy libraryInboxNotesWriteLearnAlerts
More
Ask your libraryNotificationsQuick citeReview
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A cross decomposition algorithm for a multiproduct-multitype facility location problem
16 references·2 citing·26 second hop
A cross decomposition algorithm for a multiproduct-multitype facility location problem (1993)A cross decomposition algorithm for a mul…Multicommodity Distribution System Design by Benders Decomposition * † ‡ (2010)Multicommodity Distribution S…A Cross Decomposition Algorithm for Capacitated Facility Location (1986)A Cross Decomposition Algorit…Facility location models for distribution planning (1985)Facility location models for …ADD-heuristics' starting procedures for capacitated plant location models (1985)ADD-heuristics' starting proc…A heuristic lagrangean algorithm for the capacitated plant location problem (1984)A heuristic lagrangean algori…Heuristics for the capacitated plant location model (1983)Heuristics for the capacitate…Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem (1983)Extensions to a Lagrangean re…Solving Stochastic Transportation-Location Problems by Generalized Benders Decomposition (1982)Solving Stochastic Transporta…Lagrangean Relaxation Applied to Capacitated Facility Location Problems (1978)Lagrangean Relaxation Applied…An Improved Algorithm for the Capacitated Facility Location Problem (1978)An Improved Algorithm for the…An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem (1977)An Efficient Branch and Bound…Multicommodity Distribution System Design by Benders Decomposition (1974)Multicommodity Distribution S…An efficient heuristic procedure for the uncapacitated warehouse location problem (1973)An efficient heuristic proced…An Efficient Branch and Bound Algorithm for the Warehouse Location Problem (1972)An Efficient Branch and Bound…A branch‐bound algorithm for the capacitated facilities location problem (1969)A branch‐bound algorithm for …A Branch-Bound Algorithm for Plant Location (1966)A Branch-Bound Algorithm for …Supply Chain Models (2011)Supply Chain ModelsLocation Software and Interface with GIS and Supply Chain Management (2002)Location Software and Interfa…A Heuristic Program for Locating Warehouses (1963)Warehouse Location Under Continuous Economies of Scale (1966)A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints (1986)Reverse logistics network design using simulated annealing (2009)A robust fuzzy mathematical programming model for the closed-loop supply chain network design and a whale optimization solution algorithm (2018)A Heuristic Program for Locating Warehouses (1976)Multiple Resource–Constrained Scheduling Using Branch and Bound (1978)The capacitated plant location problem (1995)Capacitated warehouse location model with risk pooling (2008)Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (1977)Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem (1999)An exact method for the two-echelon, single-source, capacitated facility location problem (2000)A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem (2004)A Dual-Based Procedure for Uncapacitated Facility Location (1978)Lagrangean heuristics for location problems (1993)A fuzzy approach to select the location of the distribution center (2001)A fuzzy multi-criteria decision model for international tourist hotels location selection (2007)Network Design and Transportation Planning: Models and Algorithms (1984)A stochastic programming approach for supply chain network design under uncertainty (2004)Facility location under uncertainty: a review (2006)An Analysis of Private and Public Sector Location Models (1970)Benders decomposition with alternative multiple cuts for a multi‐product closed‐loop supply chain network design model (2007)A Dual-Based Procedure for Dynamic Facility Location (1982)Efficient algorithms for the capacitated concentrator location problem (1987)The simple plant location problem: Survey and synthesis (1983)The design of robust value-creating supply chain networks: A critical review (2009)
this work references cited by second hop

References

  • 2010Multicommodity Distribution System Design by Benders Decomposition * † ‡978 cited
  • 1974Multicommodity Distribution System Design by Benders Decomposition907 cited
  • 1966A Branch-Bound Algorithm for Plant Location423 cited
  • 1985Facility location models for distribution planning383 cited
  • 1972An Efficient Branch and Bound Algorithm for the Warehouse Location Problem291 cited
  • 1986A Cross Decomposition Algorithm for Capacitated Facility Location270 cited
  • 1978Lagrangean Relaxation Applied to Capacitated Facility Location Problems248 cited
  • 1977An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem243 cited
  • 1969A branch‐bound algorithm for the capacitated facilities location problem186 cited
  • 1984A heuristic lagrangean algorithm for the capacitated plant location problem140 cited
  • 1983Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem136 cited
  • 1978An Improved Algorithm for the Capacitated Facility Location Problem129 cited
  • 1983Heuristics for the capacitated plant location model128 cited
  • 1973An efficient heuristic procedure for the uncapacitated warehouse location problem76 cited
  • 1982

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

Solving Stochastic Transportation-Location Problems by Generalized Benders Decomposition
59 cited
  • 1985ADD-heuristics' starting procedures for capacitated plant location models54 cited
  • Cited by

    • 2002Location Software and Interface with GIS and Supply Chain Management37 cited
    • 2011Supply Chain Models22 cited