A search tree algorithm for plant location problems-Reference-Cited by-同舟云学术

A search tree algorithm for plant location problems

Published:1981-08 Issue:4 Volume:7 Page:371-379
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Bartezzaghi E.,Colorni A.,Palermo P.C.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference18 articles.

1. An efficient branch and bound algorithm for the capacitated warehouse location problem;Akinc;Management Sci.,1977

2. Optimal location of plants;Alcouffe;Management Sci.,1976

3. Considerations on some classes of location models (in Italian);Bartezzaghi,1976

4. A branch and bound algorithm for plant location;Efroymson;Operations Res.,1966

5. Theoretical comparison, computational and practical experience with some transportation type algorithms;Elshafei,1974

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Analysis for Multi Plant Location Problem Under Concurrent Implementation of Different Carbon Policies;International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012) Proceedings;2013

2. A neural model for the p-median problem;Computers & Operations Research;2008-02

3. Comparative analysis of modern optimization tools for the p-median problem;Statistics and Computing;2006-09

4. Bidirectional Neural Network for Clustering Problems;Advances in Artificial Intelligence – IBERAMIA 2004;2004

5. An Efficient Neural Network Algorithm for the p-Median Problem;Advances in Artificial Intelligence — IBERAMIA 2002;2002