An Improved Algorithm for the Capacitated Facility Location Problem
From MaRDI portal
Publication:4187579
DOI10.2307/3009584zbMath0402.90063OpenAlexW4238125783MaRDI QIDQ4187579
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
Related Items
A cyclic allocation model for the inventory-modulated capacitated 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, Efficient algorithms for the capacitated concentrator location problem, A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints, 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, The capacitated plant location problem, A cost operator approach to multistage location-allocation, Upper and lower bounds for the single source capacitated location problem., A tree search algorithm for the p-median problem, Approximate solutions to large scale capacitated facility location problems, Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem, Locational analysis, An algorithm for the capacitated, multi-commodity multi-period facility location problem., Facility location models for distribution system design, A heuristic preprocessor supported algorithm for the capacitated plant location problem, Data-driven distributionally robust capacitated facility location problem, A branch and bound algorithm for the partial coverage capacitated plant 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, Heuristics for the capacitated plant location model, Accelerating the convergence of subgradient optimisation, Solving capacitated clustering problems, A partial dual algorithm for the capacitated warehouse location problem, Facility location models for distribution planning, 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, Facility location with increasing production costs
