An Improved Algorithm for the Capacitated Facility Location Problem
From MaRDI portal
Publication:4187579
DOI10.2307/3009584zbMATH Open0402.90063OpenAlexW4238125783MaRDI QIDQ4187579FDOQ4187579
Authors: Robert M. Nauss
Publication date: 1978
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3009584
Lagrangean RelaxationComputational EfficiencyInteger ProgrammingBranch and Bound AlgorithmCapacitated Facility Location Problem
Cited In (29)
- A cross decomposition algorithm for a multiproduct-multitype facility location problem
- Facility location models for distribution system design
- Heuristics for the capacitated plant location model
- Approximate solutions to large scale capacitated facility location problems
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
- A tree search algorithm for the p-median problem
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- A cyclic allocation model for the inventory-modulated capacitated location problem
- Data-driven distributionally robust capacitated facility location problem
- A branch-and-price algorithm for the capacitated facility location problem
- Accelerating the convergence of subgradient optimisation
- Efficient algorithms for the capacitated concentrator location problem
- A branch and bound algorithm for the partial coverage capacitated plant location problem
- A cost operator approach to multistage location-allocation
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
- Solving capacitated clustering problems
- Upper and lower bounds for the single source capacitated location problem.
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- An algorithm for the capacitated, multi-commodity multi-period facility location problem.
- A heuristic preprocessor supported algorithm for the capacitated plant location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Facility location models for distribution planning
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- Locational analysis
- A partial dual algorithm for the capacitated warehouse location problem
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- The capacitated plant location problem
- An exact method for the two-echelon, single-source, capacitated facility location problem
- Facility location with increasing production costs
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)