Site Location via Mixed-integer Programming

DOI10.1057/JORS.1972.4MaRDI QIDQ5639512zbMATH OpenOpenAlexFDO

Authors D. G. Elson

Publication date 1972

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

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

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cited in

(9)

• Facility location models for distribution planning
• A structure for distribution studies
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• New facets for the two-stage uncapacitated facility location polytope
• LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem

This page was built for publication: Site Location via Mixed-integer Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5639512)