A

approximation

PhD project repository for algorithms and research on approximation-based heuristics for the Inventory Routing Problem and related topics.

Implementation of Altieri, F., Pietracaprina, A., Pucci, G., & Vandin, F. (2021). Scalable distributed approximation of internal measures for clustering evaluation. In Proceedings of the 2021 SIAM International Conference on Data Mining (SDM) (pp. 648-656). Society for Industrial and Applied Mathematics.

Implements the methods proposed in: Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates [Jäger, 2018]

Problem solving to reduce the cost of opening factories to cover a maximal number of customers.