A Branch-Bound Algorithm for Plant Location

@article{Efroymson1966ABA,
  title={A Branch-Bound Algorithm for Plant Location},
  author={M. A. Efroymson and T. L. Ray},
  journal={Operations Research},
  year={1966},
  volume={14},
  pages={361-368}
}
This paper discusses an integer-programming method for solving a special class of discrete programming problems called plant location. The basic contribution is that the problem is formulated as an integer program in such a way that the associated continuous problem can be efficiently optimized. A branch-bound algorithm is then used to solve the problem. The method discussed in the article has been successfully used to solve "practical" location problems with upwards of fifty plants. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 95 CITATIONS

Supply chain design considering economies of scale and transport frequencies

  • European Journal of Operational Research
  • 2012
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Maximization of submodular functions: Theory and enumeration algorithms

  • European Journal of Operational Research
  • 2009
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Solution methods for the p-median problem: An annotated bibliography

  • Networks
  • 2006
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Methods for Solving the p-Median Problem: An Annotated Bibliography

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1970
2018

CITATION STATISTICS

  • 7 Highly Influenced Citations

Similar Papers