Site Location via Mixed-integer Programming
From MaRDI portal
Publication:5639512
DOI10.1057/jors.1972.4zbMath0231.90027OpenAlexW1973362214MaRDI QIDQ5639512
Publication date: 1972
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1972.4
Related Items (9)
LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY ⋮ A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. ⋮ A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations ⋮ A structure for distribution studies ⋮ Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning ⋮ A branch-and-bound algorithm for the multi-level uncapacitated facility location problem ⋮ Facility location models for distribution planning
This page was built for publication: Site Location via Mixed-integer Programming
