Comments on the 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem'. (2nd August 2019)

• Record Type: Journal Article
• Authors: Kara, İmdat; Kara, Bahar Y.
• Is Part Of: International journal of mathematics in operational research. Volume 15:Number 1(2019)
• Page Start: 26
• Page End: 32
• Publication Date: 2019-08-02
• Subjects: repairman problem -- k-travelling repairman problem -- minimum latency problem -- delivery man problem; Operations research -- Mathematical models -- Periodicals; Operations research -- Mathematics -- Periodicals; Decision making -- Mathematical models -- Periodicals; 658.4033
• Languages: English
• ISSNs: 1757-5850

Abstract

The paper 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem' claims to present the first polynomial formulation for the k-travelling repairman problem (k-TRP). We first make some corrections on this formulation and we show that the first polynomial size formulation for k-TRP is the one proposed by Kara et al. (2008).