An Improved Algorithm for the Capacitated Facility Location Problem
From MaRDI portal
Cited in
(30)- A branch and bound algorithm for the partial coverage capacitated plant location problem
- Heuristics for the capacitated plant location model
- A partial dual algorithm for the capacitated warehouse location problem
- Facility location models for distribution planning
- Efficient algorithms for the capacitated concentrator location problem
- A cost operator approach to multistage location-allocation
- A tree search algorithm for the p-median problem
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Locational analysis
- The capacitated plant location problem
- Upper and lower bounds for the single source capacitated location problem.
- An exact method for the two-echelon, single-source, capacitated facility location problem
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- Accelerating the convergence of subgradient optimisation
- Facility location with increasing production costs
- Data-driven distributionally robust capacitated facility location problem
- 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 cross decomposition algorithm for a multiproduct-multitype facility location problem
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
- A cyclic allocation model for the inventory-modulated capacitated location problem
- An algorithm for the capacitated, multi-commodity multi-period facility location problem.
- An effective aggregation heuristic for capacitated facility location problems with many demand points
- Facility location models for distribution system design
- Solving capacitated clustering problems
- A comparison of heuristics and relaxations for the capacitated plant location problem
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
- A branch-and-price algorithm for the capacitated facility location problem
- Approximate solutions to large scale capacitated facility location problems
This page was built for publication: An Improved Algorithm for the Capacitated Facility Location Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187579)
