Algorithm For Solving Weber Problem For a N-Sequentially Connected Chain
Here is set the algorithm, which reasonably solves Veber problem for n-sequentially connected chain and finite set of points of location. Сomparison of action period of a given algorithm and a model of integer linear programming, which was realized in IBM ILOG CPLEX, is carried out
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Academic Publishing House Researcher
2013-01-01
|
| Series: | Evropejskij Issledovatelʹ |
| Subjects: | |
| Online Access: | http://www.erjournal.ru/pdf.html?n=1368983912.pdf |