An LP-based heuristic for two-stage capacitated facility location problems

From MaRDI portal
Publication:3157307

DOI10.1057/palgrave.jors.2600675zbMath1054.90590OpenAlexW2036802487MaRDI QIDQ3157307

No author found.

Publication date: 13 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600675




Related Items (22)

A probabilistic model applied to emergency service vehicle locationNew facets for the two-stage uncapacitated facility location polytopeA hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problemsA review of hierarchical facility location modelsA scatter search-based heuristic to locate capacitated transshipment pointsMeta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problemSolving the robust two-stage capacitated facility location problem with uncertain transportation costsAn effective hybrid approach to the two-stage capacitated facility location problemFuzzy group decision-making for facility location selection.A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurationsFormulation and solution of a two-stage capacitated facility location problem with multilevel capacitiesThe capacitated mobile facility location problemParallel metaheuristics for workforce planningSolving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logisticsMulti-level facility location problemsA splitter location-allocation problem in designing fiber optic access networksFacility location models for distribution system designOutbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centersLower and upper bounds for a two-stage capacitated facility location problem with handling costsA branch and bound algorithm for the partial coverage capacitated plant location problemTwo-stage distributionally robust mixed-integer optimization model for three-level location-allocation problems under uncertain environmentA Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem




This page was built for publication: An LP-based heuristic for two-stage capacitated facility location problems