Solving a Two-stage Continuous-discrete Problem of Optimal Partitioning-Allocation with Subsets Centers Placement
A two-stage continuous-discrete optimal partitioning-allocation problem is studied, and a method and an algorithm for its solving are proposed. This problem is a generalization of a classical transportation problem to the case when coordinates of the production points (collection, storage, processin...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2020-06-01
|
| Series: | Open Computer Science |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/comp-2020-0142 |