Efficient solution of large scale, single-source, capacitated plant location problems
From MaRDI portal
Recommendations
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- An exact algorithm for the capacitated facility location problems with single sourcing
- Approximate solutions to large scale capacitated facility location problems
- Upper and lower bounds for the single source capacitated location problem.
Cited in
(32)- On the exact solution of large-scale simple plant location problems
- The return plant location problem: Modelling and resolution
- Upper and lower bounds for the single source capacitated location problem.
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- Multiobjective solution of the uncapacitated plant location problem
- Solving the facility location and fixed charge solid transportation problem
- A dual RAMP algorithm for single source capacitated facility location problems
- A heuristic preprocessor supported algorithm for the capacitated plant location problem
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design
- Revisiting Lagrangian relaxation for network design
- Bounds for the single source modular capacitated plant location problem
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- A heuristic for BILP problems: the single source capacitated facility location problem
- An integrated approach to dynamic plant location and capacity planning
- On the resolution of the single product capacitated machine siting problem
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
- Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
- scientific article; zbMATH DE number 4010185 (Why is no real title available?)
- scientific article; zbMATH DE number 1187081 (Why is no real title available?)
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
- A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
- An effective VNS for the capacitated \(p\)-median problem
- Scatter search for the single source capacitated facility location problem
- The capacity and distance constrained plant location problem
- Multiobjective capacitated plant location problem
This page was built for publication: Efficient solution of large scale, single-source, capacitated plant location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3157323)
